{"meta":{"query_hash":"4599bf974945","filters":{"venue":"ACM SIGPLAN Notices"},"cohort_total":167,"direct_labels_cover":1,"predictions_cover":167,"exported":167,"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/4599bf974945","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+SIGPLAN+Notices"},"results":[{"id":"W1965830444","doi":"10.1145/504359.504364","title":"Class-is-type is inadequate for object reuse","year":2001,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","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; Reuse; Programming language; Class (philosophy); Object (grammar); Class hierarchy; Parameterized complexity; Type (biology); Theoretical computer science; Method; Hierarchy; Object-oriented programming; Type safety; Artificial intelligence; Algorithm","score_opus":0.053646348472502055,"score_gpt":0.29118487873845533,"score_spread":0.23753853026595328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965830444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47752404,0.0060007693,0.36437634,0.04715142,0.016916208,0.0049741836,0.000041577485,0.0035499134,0.07946555],"genre_scores_gemma":[0.9848837,0.000039131202,0.009906159,0.0018088525,0.00032727674,0.00002501379,0.000008267654,0.000016740689,0.0029848525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984494,0.000052068808,0.00026699566,0.00049180316,0.0002698952,0.00046985236],"domain_scores_gemma":[0.99766344,0.00034658035,0.00017131005,0.0015664728,0.0001332059,0.00011899462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003807111,0.00018919064,0.00023097379,0.00009184996,0.0001910027,0.00034126788,0.002392304,0.000119985525,0.000043745793],"category_scores_gemma":[0.0004261416,0.00015432824,0.00008709812,0.00038198588,0.000041233834,0.00047253416,0.00039522944,0.000114697315,0.0004452289],"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.00030921298,0.000560755,0.048827663,0.00056948524,0.0004616223,0.0003808153,0.033377845,0.000092136426,0.0014647174,0.30739614,0.33385926,0.2727003],"study_design_scores_gemma":[0.00079717033,0.0006742555,0.0015875079,0.000013901951,0.000035987978,0.000041499872,0.00016539964,0.0075225383,0.0025251664,0.048561446,0.93756104,0.0005140736],"about_ca_topic_score_codex":0.00023784817,"about_ca_topic_score_gemma":0.000088387045,"teacher_disagreement_score":0.6037018,"about_ca_system_score_codex":0.000029572077,"about_ca_system_score_gemma":0.000071639515,"threshold_uncertainty_score":0.6293323},"labels":[],"label_agreement":null},{"id":"W1969599528","doi":"10.1145/1925844.1926390","title":"Pick your contexts well","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":167,"is_retracted":false,"has_abstract":true,"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; National Science Foundation","keywords":"Computer science; Context (archaeology); Object (grammar); Sensitivity (control systems); Abstraction; Implementation; Quality (philosophy); Theoretical computer science; Allocator; Method; Programming language; Object-oriented programming; Artificial intelligence; Distributed computing","score_opus":0.060188964330428515,"score_gpt":0.262159894383952,"score_spread":0.20197093005352346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969599528","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13944544,0.002846049,0.2212838,0.0011096234,0.008092388,0.0011596143,0.000004365095,0.0020384905,0.6240202],"genre_scores_gemma":[0.9911226,0.0000053258555,0.006703849,0.00030110273,0.0001573669,0.000009270137,0.0000021399314,0.0000086409955,0.0016896812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988696,0.000062596686,0.00020147585,0.00034017884,0.00020301531,0.00032312016],"domain_scores_gemma":[0.99872524,0.00010000587,0.00013155425,0.00087512564,0.000055289755,0.0001128042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025389605,0.000142261,0.00016990099,0.00005899163,0.00010500538,0.00014624941,0.0017211266,0.000076371674,0.00011661156],"category_scores_gemma":[0.00008476935,0.00011069073,0.000056529923,0.00014646415,0.00004711075,0.00040600036,0.00030715158,0.000101893325,0.0017359573],"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.000028020568,0.00029001615,0.06445945,0.000100036,0.00010799696,0.00026724476,0.01723467,0.0000043752993,0.00027905084,0.8318488,0.008711943,0.076668374],"study_design_scores_gemma":[0.0026682909,0.001687017,0.11915327,0.00004338583,0.000105309744,0.00018193356,0.001314781,0.0026367176,0.013584014,0.20393753,0.65246195,0.0022258172],"about_ca_topic_score_codex":0.0005090481,"about_ca_topic_score_gemma":0.00012293232,"teacher_disagreement_score":0.8516772,"about_ca_system_score_codex":0.000011692585,"about_ca_system_score_gemma":0.000029136103,"threshold_uncertainty_score":0.9990413},"labels":[],"label_agreement":null},{"id":"W1993904487","doi":"10.1145/1052883.1052890","title":"Notes on notes on postmodern programming","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Digital Games and Media","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Postmodernism; Exposition (narrative); Computer science; Modernism (music); Post modernism; Epistemology; Aesthetics; Sociology; Philosophy; Literature; Art","score_opus":0.03995879838391516,"score_gpt":0.3136374970676046,"score_spread":0.27367869868368944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993904487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85614586,0.00011422791,0.000030225503,0.01197946,0.0006788671,0.00036691976,0.000016088678,0.0002558465,0.13041252],"genre_scores_gemma":[0.9961255,0.000025808833,0.0012413377,0.0012374965,0.00050562026,0.000012116552,0.000013196458,0.000017546281,0.000821337],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985623,0.00003577481,0.00014769979,0.00028783834,0.000507349,0.0004590326],"domain_scores_gemma":[0.9983453,0.0010362851,0.000085161606,0.0002968812,0.000045400197,0.0001909722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024658977,0.00016136972,0.0001657184,0.00006549258,0.00018063463,0.00027588592,0.00047926616,0.00010195162,0.000043677403],"category_scores_gemma":[0.0027662944,0.00012665633,0.00007664049,0.00016795452,0.00018308796,0.00025576452,0.000053703432,0.0001450544,0.0004617504],"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.00008421773,0.00037951517,0.0034518526,0.000024650923,0.000032829063,0.000056568824,0.02815359,0.0005410305,0.00011901268,0.040627424,0.0000811827,0.9264481],"study_design_scores_gemma":[0.0012406979,0.0015722847,0.010584274,0.00045485547,0.00006371031,0.0000021332348,0.0052038883,0.000014343578,0.003396639,0.01126148,0.9653351,0.0008706328],"about_ca_topic_score_codex":0.0011152503,"about_ca_topic_score_gemma":0.0034318785,"teacher_disagreement_score":0.9652539,"about_ca_system_score_codex":0.00006451821,"about_ca_system_score_gemma":0.00010785809,"threshold_uncertainty_score":0.59350216},"labels":[],"label_agreement":null},{"id":"W1995176436","doi":"10.1145/1816027.1816031","title":"Singleton types here, singleton types there, singleton types everywhere","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Singleton; Computer science; Programming language; Compiler; Type (biology); Term (time); Closure (psychology); Code (set theory); Generalization; Theoretical computer science; Set (abstract data type); Mathematics","score_opus":0.015540092231221327,"score_gpt":0.2395369830586711,"score_spread":0.22399689082744978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995176436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41168594,0.0010585313,0.5722261,0.0012804924,0.002723137,0.0005234045,0.000023267341,0.0036923399,0.006786742],"genre_scores_gemma":[0.6991597,0.000030052526,0.29930943,0.00030543795,0.0004293148,0.000019870506,0.000017687205,0.00007663844,0.00065189484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971375,0.00009887783,0.00047798088,0.00092175807,0.0006171184,0.00074680377],"domain_scores_gemma":[0.9965426,0.00052398193,0.00028072,0.0021990167,0.00022014791,0.00023357112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004325771,0.0005462343,0.0004949663,0.00025767504,0.00025830732,0.000528129,0.003000619,0.00040623816,0.00014469813],"category_scores_gemma":[0.0002366875,0.0005000009,0.00014703785,0.00053963467,0.00014695578,0.0009716501,0.0007437945,0.00074520544,0.0003393521],"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.0001657003,0.001106998,0.024618203,0.0006605559,0.0005724617,0.00049330434,0.004253941,0.006035183,0.13108191,0.16845983,0.018983899,0.64356804],"study_design_scores_gemma":[0.0010750748,0.0010365195,0.005763748,0.0006309668,0.00019770513,0.00015387744,0.000040939223,0.03924681,0.103040874,0.015001041,0.83071816,0.0030942822],"about_ca_topic_score_codex":0.000336667,"about_ca_topic_score_gemma":0.00031342616,"teacher_disagreement_score":0.81173426,"about_ca_system_score_codex":0.0000817769,"about_ca_system_score_gemma":0.00013703702,"threshold_uncertainty_score":0.9997452},"labels":[],"label_agreement":null},{"id":"W2020486989","doi":"10.1145/966051.966056","title":"The ART of compiler construction projects","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Compiler; Computer science; Programming language; Scope (computer science); Process (computing); Transformation (genetics); Program transformation; Simple (philosophy); Optimizing compiler; Aggregate (composite)","score_opus":0.02848775324548692,"score_gpt":0.2595261232135164,"score_spread":0.2310383699680295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020486989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15765546,0.001623311,0.5866978,0.0025699458,0.004342616,0.0026946508,0.000012950552,0.0019029361,0.24250029],"genre_scores_gemma":[0.8833704,0.000012071758,0.1162856,0.000060227383,0.000026390648,0.00001884486,7.6537594e-7,0.0000062589315,0.00021946664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988665,0.00022522609,0.00026069186,0.00020543176,0.00025617427,0.00018596255],"domain_scores_gemma":[0.99807096,0.0006432406,0.00021957658,0.0009332269,0.00009854233,0.000034459394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263684,0.00009847982,0.00013837664,0.00005796352,0.000127525,0.0001045636,0.0010504511,0.00005434664,0.000006262187],"category_scores_gemma":[0.00039124824,0.000066947054,0.000037461756,0.00024179542,0.000121255005,0.00028204935,0.000097881304,0.000095831754,0.00004418516],"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.00001178334,0.00006105088,0.011221269,0.00008662013,0.00005943586,0.000011680086,0.0015513875,0.00002547427,0.008682397,0.93724996,0.02663465,0.014404275],"study_design_scores_gemma":[0.0010232484,0.00082834065,0.004815883,0.0003410208,0.000052045973,0.00037235668,0.0014297814,0.0056586075,0.6347086,0.09987246,0.24983494,0.0010627493],"about_ca_topic_score_codex":0.0000144536125,"about_ca_topic_score_gemma":0.000017107179,"teacher_disagreement_score":0.8373775,"about_ca_system_score_codex":0.00001631196,"about_ca_system_score_gemma":0.00006283477,"threshold_uncertainty_score":0.27300218},"labels":[],"label_agreement":null},{"id":"W2062757415","doi":"10.1145/2103621.2103705","title":"Programming with binders and indexed data-types","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Decidability; Type safety; Operational semantics; Data type; Type theory; Undecidable problem; Modular design; Programming language specification; Theoretical computer science; Semantics (computer science); Type (biology); Programming paradigm; Inductive programming; Programming domain","score_opus":0.05305382815606168,"score_gpt":0.2724485179284469,"score_spread":0.2193946897723852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062757415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63181484,0.011661957,0.33257344,0.0036491822,0.0038917155,0.0025620782,0.000013443406,0.0024303882,0.011402965],"genre_scores_gemma":[0.9749521,0.000007882682,0.02463321,0.00010701487,0.00017778225,0.00001036795,0.000016991213,0.000010154073,0.000084483174],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987632,0.000056165052,0.00014264132,0.0003564359,0.00024990836,0.00043161816],"domain_scores_gemma":[0.9984398,0.00017204051,0.00011800484,0.001081662,0.000032093136,0.00015642312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048223167,0.00014984162,0.00016282122,0.0000661957,0.00014376166,0.00031637086,0.0013230524,0.000064801505,0.0000049935225],"category_scores_gemma":[0.000093285904,0.0001018973,0.000012742242,0.00021630774,0.000090964306,0.001315851,0.0006218902,0.00011053804,0.000047182726],"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.000028442419,0.00019590686,0.60980445,0.0001782375,0.00017337201,0.00005068145,0.0065024127,0.000010329185,0.00006504782,0.09263907,0.000815217,0.28953683],"study_design_scores_gemma":[0.0035535553,0.0015300242,0.1363606,0.000090540576,0.0003296771,0.00065129227,0.0031904886,0.007272134,0.0013955871,0.006574751,0.836189,0.0028623615],"about_ca_topic_score_codex":0.00018403705,"about_ca_topic_score_gemma":0.00011338972,"teacher_disagreement_score":0.83537376,"about_ca_system_score_codex":0.000009200497,"about_ca_system_score_gemma":0.000031852498,"threshold_uncertainty_score":0.41552514},"labels":[],"label_agreement":null},{"id":"W2074713941","doi":"10.1145/1137933.1137935","title":"Developing a superset language of smalltalk for modeling distributed mechanical design systems","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Smalltalk; Computer science; Programming language; Class (philosophy); Modeling language; Software engineering; Object-oriented programming; Artificial intelligence; Software","score_opus":0.03244095803235166,"score_gpt":0.23462356760861497,"score_spread":0.2021826095762633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074713941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14347854,0.0003400836,0.8555699,0.000017126104,0.00012212874,0.00020723413,0.00007817438,0.00015213559,0.000034697026],"genre_scores_gemma":[0.9474141,0.0000083452005,0.05220578,0.0000045376646,0.00007204874,0.00003014613,0.00023191179,0.000022760963,0.000010383265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993541,0.000011994979,0.00023782611,0.00012130113,0.000095992,0.00017873282],"domain_scores_gemma":[0.9995835,0.00015899903,0.00003877661,0.00015112391,0.000044092616,0.000023545399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000133916,0.00011326218,0.0001691145,0.000049202255,0.000041007886,0.0000409122,0.0001830923,0.00007575188,0.000004717779],"category_scores_gemma":[0.0000757068,0.00010641222,0.000029416136,0.00007060587,0.0000060905686,0.00009733256,0.000022175467,0.000046463327,0.0000015226213],"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.000012086856,0.000006019845,0.000014997128,0.00042462448,0.000017372238,0.0000014062936,0.00011180477,0.99751097,0.0007878244,0.0009195552,0.000059567603,0.0001338],"study_design_scores_gemma":[0.00022399475,0.00001740068,0.000016152362,0.00007704907,0.00002566558,0.0000014242564,0.0002238004,0.9819872,0.016967218,0.0002449906,0.00007038468,0.00014476755],"about_ca_topic_score_codex":0.00016475888,"about_ca_topic_score_gemma":0.000025497879,"teacher_disagreement_score":0.8039355,"about_ca_system_score_codex":0.000029600244,"about_ca_system_score_gemma":0.000013786396,"threshold_uncertainty_score":0.43393642},"labels":[],"label_agreement":null},{"id":"W2075309900","doi":"10.1145/780822.781144","title":"Points-to analysis using BDDs","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Binary decision diagram; Computer science; Algorithm; Solver; Model checking; Simple (philosophy); Data structure; Satisfiability; Theoretical computer science; Programming language","score_opus":0.06622918099250913,"score_gpt":0.3433915543306719,"score_spread":0.2771623733381628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075309900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19949399,0.000035705496,0.7971858,0.00017179792,0.00031167123,0.00008122967,0.000001634325,0.00009313916,0.0026250586],"genre_scores_gemma":[0.40349883,7.982972e-7,0.59614617,0.000292726,0.000017842473,0.0000025196723,8.8945444e-7,0.000003896265,0.00003632284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987395,0.00020066864,0.00020751376,0.00034473758,0.00026050146,0.00024710622],"domain_scores_gemma":[0.99832237,0.00019449493,0.000105728715,0.001199745,0.00006801157,0.000109673645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082832284,0.00010927466,0.000165473,0.00030125116,0.000117351374,0.00016521008,0.0012249509,0.000048854763,0.000047080866],"category_scores_gemma":[0.0012085458,0.00010349822,0.00006770328,0.0017528577,0.000021830221,0.00052194233,0.0001629124,0.00007826877,0.00013763134],"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.00003279378,0.00027568816,0.08883579,0.000080344136,0.00096293626,0.00005314311,0.008501492,0.05759178,0.013581482,0.77866477,0.00093464,0.05048516],"study_design_scores_gemma":[0.0006271422,0.00030733342,0.08120882,0.000050666884,0.0008079,0.000027549308,0.0005558912,0.778128,0.08902867,0.017538222,0.030096332,0.0016234268],"about_ca_topic_score_codex":0.000043629454,"about_ca_topic_score_gemma":0.000018518342,"teacher_disagreement_score":0.7611265,"about_ca_system_score_codex":0.00004138868,"about_ca_system_score_gemma":0.00003346005,"threshold_uncertainty_score":0.4220535},"labels":[],"label_agreement":null},{"id":"W2077845927","doi":"10.1145/2775052.2661090","title":"Using JavaScript and WebCL for numerical computations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Computation; Code (set theory); Web application; Variety (cybernetics); Rich Internet application; World Wide Web; Artificial intelligence","score_opus":0.05326982129687474,"score_gpt":0.31206418318978846,"score_spread":0.2587943618929137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077845927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006494258,0.000070434624,0.9917233,0.00061246386,0.0001511299,0.00011401314,0.0000018077526,0.00031387483,0.0005187039],"genre_scores_gemma":[0.44913694,0.0000017664337,0.55047864,0.00030662003,0.000046187877,0.0000033010904,0.000002851598,0.0000044733447,0.000019218329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.000055098455,0.00014891333,0.00025435197,0.00009823257,0.00016756322],"domain_scores_gemma":[0.99897546,0.0004917689,0.00008398781,0.00031808988,0.00006644712,0.00006425843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022331566,0.000092067254,0.00012841937,0.000072149516,0.00021134222,0.0001858416,0.0005195422,0.00004070136,0.0000015252541],"category_scores_gemma":[0.00025889254,0.00008674201,0.000028070626,0.00013608756,0.000030392386,0.00022570684,0.00018690692,0.000051112966,0.0000040331097],"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.000039310362,0.00031032,0.011679666,0.00026901645,0.00013436448,0.0000071002983,0.004219708,0.38793066,0.0012845896,0.36726707,0.020234607,0.20662357],"study_design_scores_gemma":[0.00017442381,0.00006606953,0.00066164974,0.000014511659,0.000007870836,0.000006340837,0.000007213819,0.9863313,0.00025376343,0.00721518,0.0051363856,0.000125291],"about_ca_topic_score_codex":0.000023754628,"about_ca_topic_score_gemma":0.0000014383957,"teacher_disagreement_score":0.59840065,"about_ca_system_score_codex":0.000009251882,"about_ca_system_score_gemma":0.000018323974,"threshold_uncertainty_score":0.35372365},"labels":[],"label_agreement":null},{"id":"W2091738355","doi":"10.1145/1402227.1402229","title":"The ICFP developer conference 2008","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Functional programming; Software engineering; Programming paradigm; Programming language","score_opus":0.058293302743797064,"score_gpt":0.25570345629239927,"score_spread":0.1974101535486022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091738355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23171572,0.00919012,0.5112031,0.018671114,0.011000557,0.0019498518,0.000006510507,0.0024462978,0.21381672],"genre_scores_gemma":[0.99190676,0.00008657404,0.004867505,0.0003358645,0.00013337097,0.00001605118,0.0000020452826,0.000006528053,0.0026452765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987739,0.00008074629,0.00020287317,0.0002934923,0.00029381958,0.00035521158],"domain_scores_gemma":[0.9984733,0.0003685975,0.00010690984,0.000849131,0.00011606369,0.00008603788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029604306,0.00013456921,0.00013493713,0.00003087865,0.0006033041,0.0002634198,0.0021659073,0.00006078991,0.000019488998],"category_scores_gemma":[0.00020955803,0.00008023033,0.000039190887,0.0002080078,0.0001404345,0.00033441986,0.00034931937,0.00012205406,0.0006454844],"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.000019272393,0.00010840635,0.03613276,0.000039342776,0.000104489845,0.00032243095,0.010976627,0.000032554308,0.00026348655,0.791504,0.053413257,0.10708333],"study_design_scores_gemma":[0.0004447883,0.00016050845,0.026759416,0.000008248887,0.000010657306,0.00023283467,0.00028135133,0.0025044023,0.0013411335,0.017095871,0.9506054,0.00055537117],"about_ca_topic_score_codex":0.00016785944,"about_ca_topic_score_gemma":0.0001765171,"teacher_disagreement_score":0.8971922,"about_ca_system_score_codex":0.000014407235,"about_ca_system_score_gemma":0.00013157695,"threshold_uncertainty_score":0.82966113},"labels":[],"label_agreement":null},{"id":"W2096199323","doi":"10.1145/2103621.2103693","title":"Verification of parameterized concurrent programs by modular reasoning about data and control","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"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; Thread (computing); Parameterized complexity; Modular design; Programming language; Separation logic; Control flow; Theoretical computer science; Boolean data type; Bounded function; Algorithm","score_opus":0.06308417104739514,"score_gpt":0.3242422977401453,"score_spread":0.2611581266927502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096199323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35597494,0.0022093384,0.64064693,0.00012103081,0.00045840137,0.00037181153,0.000049211474,0.000094876676,0.00007342538],"genre_scores_gemma":[0.6662638,0.000033036507,0.33354557,0.000029903887,0.000031131935,0.00001683286,0.00007078557,0.000005226948,0.000003685882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986913,0.00020311915,0.00029262,0.00032096021,0.00023716278,0.00025481792],"domain_scores_gemma":[0.9977568,0.00023503811,0.0003258169,0.0015258043,0.000056552984,0.00009998709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011721582,0.00012016106,0.00019719616,0.000039374856,0.00006623196,0.00010561115,0.0015071027,0.00006279999,0.0000028777638],"category_scores_gemma":[0.0008190322,0.00010852616,0.000017345556,0.00015089537,0.00010334706,0.0013801395,0.00032417363,0.000091952286,0.0000069066355],"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.00006789812,0.00042051973,0.04349889,0.00024400526,0.00012102073,9.000793e-7,0.0031469641,0.000023234146,0.08765104,0.036532074,0.0004293951,0.82786405],"study_design_scores_gemma":[0.002406484,0.00043228603,0.08029246,0.00021932159,0.0001665546,0.00002124073,0.00023346585,0.84906244,0.041138656,0.0005874996,0.024656497,0.000783085],"about_ca_topic_score_codex":0.000031650696,"about_ca_topic_score_gemma":7.785889e-7,"teacher_disagreement_score":0.8490392,"about_ca_system_score_codex":0.000012555643,"about_ca_system_score_gemma":0.000016227732,"threshold_uncertainty_score":0.44255686},"labels":[],"label_agreement":null},{"id":"W2108650361","doi":"10.1145/1411203.1411218","title":"A type-preserving compiler in Haskell","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Haskell; Compiler; Programming language; Mathematical proof; Optimizing compiler; Type (biology); Functional programming","score_opus":0.06064749100290676,"score_gpt":0.26887921156124334,"score_spread":0.20823172055833658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108650361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87790006,0.0023008264,0.031935804,0.0016982696,0.0032113364,0.00072508026,0.0000017638728,0.0008134545,0.08141337],"genre_scores_gemma":[0.9940282,0.00001460382,0.0049788062,0.000214754,0.00011601264,0.000006319939,0.0000034013894,0.000007622627,0.00063027826],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988675,0.000079647514,0.00020760324,0.00031072117,0.00022445554,0.00031006662],"domain_scores_gemma":[0.99880725,0.00021695055,0.00008286778,0.0007730349,0.00004778685,0.000072128656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023939161,0.000119847675,0.0001771264,0.0000949954,0.00011263125,0.000099063654,0.001568827,0.000068961475,0.000036511767],"category_scores_gemma":[0.00015804969,0.0001003787,0.000033796863,0.00037167914,0.00004608915,0.00040078137,0.00043436416,0.00013534559,0.00040135774],"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.0000570174,0.0005533213,0.7554055,0.0002466874,0.00008329675,0.0015787651,0.021836596,0.00094296585,0.0010280852,0.17314444,0.025871027,0.019252311],"study_design_scores_gemma":[0.003775482,0.0011213173,0.40648517,0.00009680332,0.000031254393,0.00047519174,0.0007681245,0.07387786,0.0028103583,0.053980343,0.45417038,0.0024076963],"about_ca_topic_score_codex":0.00062699075,"about_ca_topic_score_gemma":0.00034219466,"teacher_disagreement_score":0.42829934,"about_ca_system_score_codex":0.00001942527,"about_ca_system_score_gemma":0.0000451717,"threshold_uncertainty_score":0.5158776},"labels":[],"label_agreement":null},{"id":"W2109819183","doi":"10.1145/1925844.1926432","title":"Delay-bounded scheduling","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"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; Concurrency; Scheduling (production processes); Context switch; Distributed computing; Bounded function; Limiting; Parallel computing; Task (project management); Programming language; Mathematical optimization","score_opus":0.06042743518341133,"score_gpt":0.2581025017501475,"score_spread":0.19767506656673617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109819183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7624238,0.00043269288,0.19583175,0.0003553016,0.0015637738,0.0003140763,0.000002175417,0.0008169248,0.03825952],"genre_scores_gemma":[0.6736229,0.0000032143075,0.3259805,0.00013954494,0.00012240506,0.000009353673,0.0000016846577,0.00001429884,0.00010610257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998078,0.00011090054,0.00038488198,0.00055683055,0.0003754954,0.000493898],"domain_scores_gemma":[0.9976686,0.0002889667,0.00022328901,0.0015401564,0.000098110264,0.00018083288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058674056,0.00022130534,0.00025255315,0.00014928346,0.00019971708,0.00034630098,0.00277712,0.000115470866,0.0000806584],"category_scores_gemma":[0.00033780624,0.00020051873,0.00008188079,0.00036575948,0.000055061802,0.0013934736,0.00058307697,0.00020060982,0.0010460756],"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.00017877932,0.00094399607,0.103357546,0.0007069092,0.00092543213,0.0020464945,0.07027536,0.0027976322,0.028260468,0.68044895,0.0020425578,0.10801586],"study_design_scores_gemma":[0.0064501,0.0018548102,0.099315286,0.0014714878,0.00037152594,0.001440012,0.004757797,0.5577734,0.14491735,0.15682629,0.016782083,0.008039826],"about_ca_topic_score_codex":0.0004657067,"about_ca_topic_score_gemma":0.00005098856,"teacher_disagreement_score":0.5549758,"about_ca_system_score_codex":0.000034749908,"about_ca_system_score_gemma":0.000086475826,"threshold_uncertainty_score":0.9997317},"labels":[],"label_agreement":null},{"id":"W2113124751","doi":"10.1145/356989.357009","title":"OS and compiler considerations in the design of the IA-64 architecture","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Compiler; Instruction-level parallelism; Instruction set; Computer architecture; Exploit; Parallelism (grammar); Architecture; Addressing mode; Parallel computing; Programming language; Operating system; Instructions per cycle","score_opus":0.028591066831945428,"score_gpt":0.26507831811897303,"score_spread":0.2364872512870276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113124751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14397192,0.0008142382,0.82902783,0.017662754,0.00015183858,0.0010465021,0.000009034813,0.00028450091,0.007031404],"genre_scores_gemma":[0.88306427,0.000011114134,0.115807,0.0010556326,0.00001447281,0.000005944333,5.6847256e-7,0.0000024127228,0.000038574333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992073,0.00026952123,0.00014737344,0.00014192646,0.00013100354,0.0001028739],"domain_scores_gemma":[0.99841666,0.0009928736,0.000058400958,0.00049590174,0.000021135143,0.000015014766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030797475,0.00007193659,0.000087375556,0.00003857928,0.00013783973,0.00009576026,0.00074224797,0.000032270156,0.00002352312],"category_scores_gemma":[0.00012305392,0.00004006762,0.000018298404,0.00018355469,0.000081107886,0.00008319954,0.00008808642,0.000120019715,0.0000027563028],"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.00002131554,0.00020040816,0.008322731,0.000040046907,0.000034695957,0.000017788569,0.024733495,0.8714036,0.00040283773,0.033105593,0.017865153,0.04385235],"study_design_scores_gemma":[0.0012294139,0.00034954463,0.1224148,0.00024020142,0.000041197338,0.00018796406,0.00023246133,0.7193373,0.004808769,0.14284171,0.0076210885,0.00069558003],"about_ca_topic_score_codex":0.00003658132,"about_ca_topic_score_gemma":0.000022787828,"teacher_disagreement_score":0.73909235,"about_ca_system_score_codex":0.0000033414544,"about_ca_system_score_gemma":0.000027744578,"threshold_uncertainty_score":0.16339102},"labels":[],"label_agreement":null},{"id":"W2113401164","doi":"10.1145/1993316.1993573","title":"Synchronization via scheduling","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Electronic Arts (Canada); Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Programmer; Debugging; Scheduling (production processes); Rollback; Distributed computing; Parallel computing; Synchronization (alternating current); Programming language; Database transaction","score_opus":0.031814918067509676,"score_gpt":0.23704277231943496,"score_spread":0.2052278542519253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113401164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029176673,0.0002692173,0.96128696,0.00014703658,0.00064188434,0.000099046905,0.000004336265,0.00023755067,0.008137309],"genre_scores_gemma":[0.9399221,0.0000034689574,0.059784777,0.00012712769,0.00008152738,0.000005554306,0.000007261333,0.000005879203,0.00006229382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991504,0.000032164742,0.00018056884,0.00026218145,0.00016587645,0.00020882123],"domain_scores_gemma":[0.9990635,0.000051960356,0.000104902305,0.000645311,0.00006633272,0.000068023124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015982897,0.00009975871,0.00011284837,0.000043911026,0.00010261663,0.00010464035,0.0011077151,0.000054029508,0.000052331336],"category_scores_gemma":[0.00007891658,0.000089302775,0.000028372913,0.00024321262,0.000021426069,0.0006226713,0.00016604929,0.00007105842,0.0002714903],"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.00005543249,0.00072864053,0.074851885,0.00043794478,0.00025290003,0.00037418737,0.021270717,0.0043178294,0.003919062,0.34131092,0.004103071,0.5483774],"study_design_scores_gemma":[0.0013210578,0.00036019017,0.04939254,0.00031281656,0.000047611764,0.000089633715,0.00033520872,0.9017051,0.00986217,0.017959338,0.01716885,0.0014454955],"about_ca_topic_score_codex":0.000114173585,"about_ca_topic_score_gemma":0.000018574354,"teacher_disagreement_score":0.91074544,"about_ca_system_score_codex":0.000015899093,"about_ca_system_score_gemma":0.000024454443,"threshold_uncertainty_score":0.36416614},"labels":[],"label_agreement":null},{"id":"W2128328132","doi":"10.1145/1639949.1640093","title":"Empirical assessment of object-oriented implementations with multiple inheritance and static typing","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"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; Executable; Programming language; Compiler; Compile time; Just-in-time compilation; Java; Theoretical computer science; Inheritance (genetic algorithm); Parallel computing","score_opus":0.04083546651247664,"score_gpt":0.3391471307351192,"score_spread":0.29831166422264255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128328132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58672476,0.00018000935,0.41068795,0.0007431137,0.00013971634,0.0003825685,0.000004416166,0.00011334468,0.0010241168],"genre_scores_gemma":[0.91599727,0.000004861425,0.08378053,0.00016145007,0.00001943458,0.0000088005445,0.0000066972125,0.0000034779453,0.000017460272],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991231,0.00005788925,0.00021048824,0.00023714956,0.00018112351,0.00019028035],"domain_scores_gemma":[0.99913764,0.00025085369,0.00015264949,0.00033702294,0.0000615821,0.000060252114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017570087,0.000099069934,0.00015676505,0.000054118806,0.000097397664,0.000083060826,0.00031712497,0.000024626715,0.0000039922325],"category_scores_gemma":[0.000061032162,0.00007448211,0.000016530454,0.0002352856,0.000038405837,0.00028609583,0.00006899428,0.00006539991,0.0000016196145],"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.000027310252,0.0002971387,0.86482805,0.00013412413,0.00009134453,0.000030560626,0.00865346,0.0001986229,0.0012865404,0.08291726,0.0004317135,0.041103903],"study_design_scores_gemma":[0.0019780148,0.0018442103,0.9516924,0.00004514651,0.000049465238,0.000028586252,0.0027689082,0.029890247,0.00077248807,0.0061595435,0.0043055634,0.00046544374],"about_ca_topic_score_codex":0.00008770356,"about_ca_topic_score_gemma":0.00020027629,"teacher_disagreement_score":0.32927254,"about_ca_system_score_codex":0.000018210896,"about_ca_system_score_gemma":0.000057851506,"threshold_uncertainty_score":0.30372924},"labels":[],"label_agreement":null},{"id":"W2136271630","doi":"10.1145/1925844.1926389","title":"Points-to analysis with efficient strong updates","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"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; Singleton; Flow (mathematics); Set (abstract data type); Program analysis; Compiler; Sensitivity (control systems); Abstract interpretation; Optimizing compiler; Key (lock); Static analysis; Quadratic equation; Theoretical computer science; Algorithm; Programming language; Mathematics; Operating system","score_opus":0.027640971344499457,"score_gpt":0.2537133634451165,"score_spread":0.22607239210061708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136271630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0850456,0.000024656203,0.90920156,0.00031390725,0.00005012275,0.00010400268,0.0000023062166,0.0004952582,0.004762609],"genre_scores_gemma":[0.597808,8.110551e-7,0.40193844,0.0001913246,0.000011136011,0.0000045485904,0.0000033048784,0.000004368844,0.00003804745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889475,0.000053506577,0.0001716053,0.00039095356,0.00023271234,0.00025648283],"domain_scores_gemma":[0.99869144,0.000101207566,0.00010318216,0.0008927716,0.00009170921,0.00011970964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024221092,0.00013685023,0.0001832777,0.0003173065,0.00011460006,0.0001277821,0.0014663015,0.000034559416,0.000042255375],"category_scores_gemma":[0.00006303409,0.00010545731,0.00005022077,0.0011036017,0.000028149278,0.00015324797,0.00034217868,0.00007345026,0.00007487021],"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.0001538079,0.00072775764,0.15685917,0.00004558945,0.0014767996,0.00013682262,0.01641106,0.7276919,0.00010838279,0.07323623,0.0049132607,0.018239204],"study_design_scores_gemma":[0.0004149247,0.0006250069,0.07477708,0.000052775602,0.0003112314,0.0000061997625,0.00019616836,0.9108617,0.010023103,0.000858896,0.0010104855,0.0008624777],"about_ca_topic_score_codex":0.00011847647,"about_ca_topic_score_gemma":0.00004698025,"teacher_disagreement_score":0.5127624,"about_ca_system_score_codex":0.000015512695,"about_ca_system_score_gemma":0.000023832086,"threshold_uncertainty_score":0.43004242},"labels":[],"label_agreement":null},{"id":"W2148708444","doi":"10.1145/1149982.1149988","title":"A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Memoization; Recursion (computer science); Programming language; Backtracking; Time complexity; Parsing; Theoretical computer science; Algorithm; Modular design; Top-down parsing","score_opus":0.007901481672039504,"score_gpt":0.2541193857042048,"score_spread":0.24621790403216529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148708444","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68071645,0.004024692,0.2948066,0.015667243,0.0006515635,0.00085354963,0.00002890185,0.0016857632,0.001565231],"genre_scores_gemma":[0.29883334,0.0000032702014,0.7003128,0.00039096057,0.00015012264,0.0000016630918,0.00000732811,0.000009616686,0.00029091415],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986925,0.000061679435,0.00023185772,0.00045474235,0.00021731299,0.0003419074],"domain_scores_gemma":[0.99906814,0.00015728116,0.000091104965,0.00054104434,0.000030416048,0.00011203817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965266,0.00017322483,0.00020861867,0.00020516825,0.000098599434,0.0003735596,0.001130284,0.00010128652,0.000016034457],"category_scores_gemma":[0.00012827544,0.00015828748,0.00002454997,0.0003063583,0.00002463878,0.00074258854,0.00070735905,0.00019713795,0.000032463653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033653505,0.000055059132,0.0035805744,0.000026650396,0.00000570208,0.00009013443,0.0010773658,0.000021112268,0.014051845,0.00050098763,0.015157682,0.9653992],"study_design_scores_gemma":[0.0050737574,0.0016201275,0.12200955,0.002309899,0.00010499719,0.00051338645,0.000163372,0.10854946,0.48466918,0.21053195,0.058855914,0.005598413],"about_ca_topic_score_codex":0.002731031,"about_ca_topic_score_gemma":0.00030938277,"teacher_disagreement_score":0.95980084,"about_ca_system_score_codex":0.000056762266,"about_ca_system_score_gemma":0.000055779652,"threshold_uncertainty_score":0.6454776},"labels":[],"label_agreement":null},{"id":"W2156742168","doi":"10.1145/1133255.1133995","title":"Shared memory programming for large scale machines","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Compiler; Parallel computing; Scalability; Runtime system; Distributed memory; Partitioned global address space; Optimizing compiler; Programming paradigm; Shared memory; Asynchronous communication; Programming language; Operating system","score_opus":0.016197497304911726,"score_gpt":0.2706697248421612,"score_spread":0.25447222753724946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156742168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009586799,0.0002539396,0.98547536,0.0008057432,0.00022056879,0.00035586284,0.00001531837,0.0011914759,0.0020949428],"genre_scores_gemma":[0.32779557,0.0000013047348,0.67130053,0.00018686555,0.0001595967,0.00004118439,0.000044019114,0.000010653385,0.00046032047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989443,0.000034493278,0.00021126878,0.00034251047,0.00015753029,0.00030989852],"domain_scores_gemma":[0.9989849,0.00022526241,0.000121448174,0.00053876895,0.0000843899,0.00004524892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030385167,0.00013442371,0.00014849877,0.00009193389,0.0002326226,0.0002973919,0.0011454344,0.00006016236,0.000006619784],"category_scores_gemma":[0.00010043087,0.000121219404,0.00006413255,0.00020559716,0.000016302869,0.00035499866,0.00025932837,0.000066449145,0.0000138581445],"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.0001703813,0.0023322378,0.059037965,0.0009913475,0.00018584533,0.00008632223,0.0066618025,0.058040574,0.00236835,0.14832191,0.25445968,0.46734357],"study_design_scores_gemma":[0.00094124867,0.0001755737,0.004394231,0.000068022346,0.000020928457,0.0000103734155,0.00003990509,0.9400597,0.0042256666,0.011534629,0.037942234,0.00058745855],"about_ca_topic_score_codex":0.00007072561,"about_ca_topic_score_gemma":0.000068244466,"teacher_disagreement_score":0.88201916,"about_ca_system_score_codex":0.00001338203,"about_ca_system_score_gemma":0.000022713095,"threshold_uncertainty_score":0.49431837},"labels":[],"label_agreement":null},{"id":"W2243433439","doi":"10.1145/2480361.2371407","title":"Synthesizing iterators from abstraction functions","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Programming language; Computer science; Abstraction","score_opus":0.012079789493250689,"score_gpt":0.2101174085908758,"score_spread":0.1980376190976251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243433439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86697495,0.0023932976,0.11429539,0.00008277547,0.004294975,0.00027832834,0.0000735473,0.0013656992,0.010241029],"genre_scores_gemma":[0.9949017,0.000009925317,0.0041978317,0.0000208027,0.0007133102,0.000020806556,0.000045550874,0.00003145082,0.0000586035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993943,0.00001805908,0.00017121152,0.000098493416,0.00009988004,0.00021805335],"domain_scores_gemma":[0.9992833,0.00030997986,0.00004851923,0.0002651345,0.000018512916,0.00007454766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006922753,0.000116442076,0.00011415651,0.00005941451,0.00007293409,0.000044288565,0.00010880867,0.000070849885,0.000113247566],"category_scores_gemma":[0.00012889424,0.000118417585,0.000027864848,0.000086906126,0.000007970133,0.000834443,0.00001361631,0.00009895663,0.00035725764],"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.000028438864,0.00005975493,0.05414699,0.00008365524,0.00026313556,0.000004369164,0.001716654,0.86070585,0.051598426,0.00024735878,0.0019447198,0.029200628],"study_design_scores_gemma":[0.0025803535,0.000109242064,0.27923328,0.0005838032,0.00084671116,0.000037499307,0.0049835173,0.4666455,0.04711111,0.0008923294,0.1935188,0.0034578685],"about_ca_topic_score_codex":0.000051224637,"about_ca_topic_score_gemma":0.000024762116,"teacher_disagreement_score":0.39406037,"about_ca_system_score_codex":0.000055603534,"about_ca_system_score_gemma":0.0000029373525,"threshold_uncertainty_score":0.4828929},"labels":[],"label_agreement":null},{"id":"W2295265000","doi":"10.1145/1064978.1065026","title":"Optimising aspectJ","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Computer science; Compiler; Programming language; Aspect-oriented programming; Optimizing compiler; Context (archaeology); Compile time; Implementation; Java; Just-in-time compilation; Code (set theory); Overhead (engineering); Software; Set (abstract data type)","score_opus":0.047105354659099805,"score_gpt":0.30287257589711364,"score_spread":0.2557672212380138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295265000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011504733,0.00043450887,0.9839927,0.0014666672,0.0003734944,0.00005275121,8.199863e-7,0.00096030004,0.0012140068],"genre_scores_gemma":[0.21237618,0.0000101722335,0.7870838,0.00022460445,0.00016715207,0.0000030515214,7.6234556e-7,0.000008755852,0.0001255297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990109,0.00005094753,0.00014726815,0.00029673162,0.00020100406,0.00029311908],"domain_scores_gemma":[0.9976161,0.0013657806,0.00006139957,0.0008527356,0.000035382815,0.000068587455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034189352,0.0001278119,0.00013796888,0.000094963565,0.000081442886,0.00013083033,0.0015995846,0.000050603572,0.000015371128],"category_scores_gemma":[0.0018484344,0.00011827552,0.000034748624,0.00023867039,0.000029561359,0.0008275816,0.0004179097,0.00014255558,0.00013290018],"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.0000053778936,0.00003342229,0.0003452802,0.000021874408,0.00002565511,0.00004099593,0.0013033793,0.6613349,0.0022521624,0.01737403,0.000987726,0.3162752],"study_design_scores_gemma":[0.002960954,0.0007950107,0.032204505,0.00036920077,0.000102755424,0.00037401097,0.0005267741,0.33701006,0.22755267,0.17657001,0.21629342,0.0052406415],"about_ca_topic_score_codex":0.0000047262315,"about_ca_topic_score_gemma":0.000004210227,"teacher_disagreement_score":0.32432482,"about_ca_system_score_codex":0.000038981405,"about_ca_system_score_gemma":0.000019774998,"threshold_uncertainty_score":0.48231357},"labels":[],"label_agreement":null},{"id":"W2417861403","doi":"10.1145/2442776.2448985","title":"Nourishing the future of the field","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Field (mathematics); Programming language","score_opus":0.08796826918461018,"score_gpt":0.3727772185092972,"score_spread":0.28480894932468703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417861403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9317028,0.0011063548,0.0006032371,0.039105196,0.010037741,0.00019691647,0.00001830239,0.000033175464,0.017196264],"genre_scores_gemma":[0.996206,0.0000027260253,0.0004740577,0.0014538853,0.00065381965,0.0000012335113,0.0000010116927,0.0000027113338,0.0012045698],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981645,0.0001711668,0.0002825889,0.00020507045,0.0009632112,0.00021345873],"domain_scores_gemma":[0.9925817,0.0049565556,0.00024228312,0.0021089227,0.00006554024,0.00004500314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044822674,0.0000695596,0.000099991186,0.00004960681,0.00029193712,0.00027676224,0.0034001663,0.00003076638,0.00027158175],"category_scores_gemma":[0.005808564,0.00002818823,0.00007663833,0.0005404302,0.000066650675,0.0003076636,0.0011612526,0.00012451602,0.00014413334],"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.000008644298,0.000043290307,0.120871484,0.0000058685346,0.000016345452,5.334827e-7,0.003108048,0.000159473,0.00005171034,0.0042998143,0.7239853,0.14744945],"study_design_scores_gemma":[0.00008526252,0.000016092801,0.17944986,0.000016178124,0.000023012493,0.0000017686159,0.004964063,0.000525654,0.0007107111,0.0037246442,0.81039345,0.000089279696],"about_ca_topic_score_codex":0.0000676715,"about_ca_topic_score_gemma":0.00008372775,"teacher_disagreement_score":0.14736016,"about_ca_system_score_codex":0.000004718759,"about_ca_system_score_gemma":0.0000130437575,"threshold_uncertainty_score":0.69538134},"labels":[],"label_agreement":null},{"id":"W2561581089","doi":"10.1145/3170492.3136047","title":"Refining semantics for multi-stage programming","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Programming language; Semantics (computer science); Operational semantics; Refining (metallurgy); Denotational semantics","score_opus":0.15089642219391422,"score_gpt":0.3545386559795554,"score_spread":0.2036422337856412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561581089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01603244,0.00036268128,0.9755327,0.0012916198,0.002660675,0.00072823965,0.000006468974,0.00064105843,0.0027440935],"genre_scores_gemma":[0.77382064,0.0000025653535,0.22391957,0.00007242116,0.00020546885,0.000047091682,0.0000062111762,0.000014726218,0.0019113012],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856085,0.000033771536,0.00025191248,0.00045765025,0.00021751346,0.0004782918],"domain_scores_gemma":[0.9974562,0.00021911148,0.00041692183,0.001701395,0.00010017872,0.00010620468],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061749027,0.00018003625,0.0002339473,0.000057527242,0.0008759143,0.001440332,0.0028183963,0.00010128612,0.000002977239],"category_scores_gemma":[0.0009133633,0.0001493701,0.00009008801,0.00005703691,0.000079154095,0.0007147674,0.0005960955,0.00011575195,0.00006000041],"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.00002553567,0.00024515594,0.07867367,0.0005968961,0.0001406481,0.00012846114,0.0043167104,0.000054317963,0.0005501678,0.4282505,0.00069593877,0.48632202],"study_design_scores_gemma":[0.0030431903,0.0007483878,0.016916433,0.00008205394,0.00008886264,0.000030502815,0.0006034373,0.0960625,0.0032078677,0.0044146995,0.8733828,0.0014192531],"about_ca_topic_score_codex":0.00027665985,"about_ca_topic_score_gemma":0.000395387,"teacher_disagreement_score":0.87268686,"about_ca_system_score_codex":0.000017277933,"about_ca_system_score_gemma":0.000041779407,"threshold_uncertainty_score":0.9995963},"labels":[],"label_agreement":null},{"id":"W2949526574","doi":"10.1145/3093333.3009865","title":"Sums of uncertainty: refinements go gradual","year":2017,"lang":"en","type":"preprint","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"","keywords":"Computer science; Sublanguage; Programming language; Type (biology); Property (philosophy); Type safety; Matching (statistics); Type theory; Exception handling; Dependent type; Translation (biology); Theoretical computer science; Algorithm; Mathematics; Lambda calculus","score_opus":0.067837250469205,"score_gpt":0.3078142686404972,"score_spread":0.23997701817129222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949526574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50249034,0.014637673,0.17200416,0.010658186,0.06430779,0.007390849,0.0002967118,0.003318384,0.2248959],"genre_scores_gemma":[0.99402463,0.00004914381,0.004142161,0.00006780028,0.00034055967,0.00003556528,0.00007517684,0.000017670976,0.0012472821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975443,0.00012559492,0.0005196206,0.00078122487,0.0006061584,0.00042313358],"domain_scores_gemma":[0.99497044,0.00021949895,0.0011004979,0.0034059768,0.00018181752,0.00012179337],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000675182,0.00034904433,0.0005956274,0.00013841594,0.00018229954,0.0005077324,0.0059378557,0.00029762025,0.00001799919],"category_scores_gemma":[0.00043489857,0.00028613076,0.00017661921,0.00008163557,0.00013789837,0.00022954034,0.0038087524,0.0003982772,0.0001268524],"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.00012645008,0.0008006802,0.07053193,0.0051992037,0.001808867,0.00042079634,0.013786763,0.0026628699,0.00062419946,0.5302999,0.036892522,0.33684582],"study_design_scores_gemma":[0.0038890901,0.0016114714,0.028863365,0.0009112565,0.00059980917,0.00006365026,0.000510996,0.022507163,0.00450555,0.5596709,0.3720945,0.004772223],"about_ca_topic_score_codex":0.0026495466,"about_ca_topic_score_gemma":0.0004881886,"teacher_disagreement_score":0.4915343,"about_ca_system_score_codex":0.000042467476,"about_ca_system_score_gemma":0.00019430339,"threshold_uncertainty_score":0.9999591},"labels":[],"label_agreement":null},{"id":"W2950841231","doi":"10.1145/2692916.2555267","title":"A general technique for non-blocking trees","year":2014,"lang":"en","type":"preprint","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Computer science; Tree (set theory); Java; Word (group theory); Class (philosophy); Theoretical computer science; Algorithm; Parallel computing; Programming language; Mathematics; Combinatorics; Artificial intelligence; Computer network","score_opus":0.024628206831011055,"score_gpt":0.28293714052447555,"score_spread":0.25830893369346447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950841231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011117975,0.00022509853,0.98305595,0.0008179825,0.0017790957,0.0012378735,0.00017999338,0.0003008231,0.001285217],"genre_scores_gemma":[0.81883204,0.0000081180415,0.17880857,0.00025977698,0.00089025655,0.00071789895,0.00011901585,0.000029404653,0.0003349153],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976813,0.000071914634,0.00049791083,0.0009384685,0.0003202796,0.0004900805],"domain_scores_gemma":[0.9967716,0.00035303185,0.00048347298,0.0021044933,0.00016461928,0.00012279124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062815857,0.00039913645,0.00059354794,0.00013529678,0.00016892409,0.00060483627,0.0040235603,0.00040531752,0.0000040624805],"category_scores_gemma":[0.00020480991,0.00036159364,0.00022617252,0.0001378296,0.000040520496,0.00019656663,0.0016482337,0.00039020178,0.000023004286],"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.00032628418,0.0014474026,0.013238046,0.014585262,0.0020779918,0.0004356213,0.010972245,0.13271487,0.07630387,0.154684,0.30321926,0.28999513],"study_design_scores_gemma":[0.0014492866,0.00040799176,0.0038660595,0.0024155378,0.0001353277,0.000049319086,0.000052872187,0.78412503,0.022591105,0.028497396,0.15358712,0.0028229745],"about_ca_topic_score_codex":0.00021499657,"about_ca_topic_score_gemma":0.000072552386,"teacher_disagreement_score":0.80771405,"about_ca_system_score_codex":0.00005038332,"about_ca_system_score_gemma":0.00012856661,"threshold_uncertainty_score":0.9998836},"labels":[],"label_agreement":null},{"id":"W2951835710","doi":"10.1145/2578855.2535879","title":"Applying quantitative semantics to higher-order quantum computing","year":2014,"lang":"en","type":"preprint","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","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":"Dalhousie University","funders":"Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Denotational semantics; Action semantics; Denotational semantics of the Actor model; Well-founded semantics; Operational semantics; Semantics (computer science); Normalisation by evaluation; Recursion (computer science); Finitary; Computer science; Quantum computer; Quantum entanglement; Programming language; Theoretical computer science; Mathematics; Quantum; Discrete mathematics; Quantum mechanics; Physics","score_opus":0.060946178451663544,"score_gpt":0.31396389796085034,"score_spread":0.2530177195091868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951835710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013034395,0.00056421076,0.97277224,0.0016436481,0.006874845,0.0014355861,0.000005630049,0.0007704102,0.0028990335],"genre_scores_gemma":[0.8698901,0.0000070797937,0.1284364,0.00068161834,0.00060592394,0.00009205787,0.000032836466,0.00004173718,0.00021227977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962919,0.00031459008,0.00068461953,0.0012787187,0.0006782303,0.0007519493],"domain_scores_gemma":[0.99549764,0.0011119752,0.0006904186,0.0021086612,0.0003383903,0.0002528956],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010867901,0.0005597324,0.00080298405,0.0002683802,0.00031805946,0.0011023608,0.0041527986,0.0003699795,0.0000114956665],"category_scores_gemma":[0.000546341,0.00049793406,0.00015904556,0.00044326266,0.00007809404,0.00021318468,0.004637512,0.0007053629,0.00060910225],"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.000020207552,0.00015045587,0.003450526,0.0013073874,0.00029782607,0.0001042113,0.008230435,0.018607253,0.0001405112,0.93804383,0.0040130336,0.025634345],"study_design_scores_gemma":[0.0010794443,0.0009923653,0.0046923785,0.0006636079,0.00024109815,0.000034262015,0.0010224808,0.5919705,0.0004947619,0.16486402,0.22985215,0.0040929466],"about_ca_topic_score_codex":0.0006390996,"about_ca_topic_score_gemma":0.00008849847,"teacher_disagreement_score":0.8568557,"about_ca_system_score_codex":0.000066346205,"about_ca_system_score_gemma":0.00013193379,"threshold_uncertainty_score":0.9999346},"labels":[],"label_agreement":null},{"id":"W2952568606","doi":"10.1145/2499370.2462177","title":"Quipper","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Quantum algorithm; Programming language; Scalability; Set (abstract data type); Quantum gate; Computation; Computer engineering","score_opus":0.010881866858145378,"score_gpt":0.22561920259834484,"score_spread":0.21473733574019946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952568606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9491757,0.00021224844,0.037512317,0.008456367,0.00077263446,0.00016648226,0.0000013957076,0.00049891334,0.0032039264],"genre_scores_gemma":[0.8936769,0.0000019150682,0.104935855,0.0009883675,0.00018200293,0.0000066544812,0.0000013965289,0.0000070349324,0.0001999198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999065,0.000037054084,0.00013136267,0.00029054645,0.00018654484,0.0002894872],"domain_scores_gemma":[0.99879134,0.00024494051,0.000055050245,0.000771787,0.000040654537,0.00009620328],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009982515,0.00011758958,0.00011070502,0.00006070099,0.00012481764,0.00030379757,0.0015921412,0.000041178173,0.00009226002],"category_scores_gemma":[0.00009276658,0.000089006986,0.00004189062,0.00018243334,0.000030509314,0.00034305145,0.00047877108,0.00013316734,0.0010088116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039015645,0.00018604034,0.008498588,0.00006625892,0.0000803174,0.00007537036,0.006780613,0.0066973562,0.0038514328,0.03142342,0.044524174,0.89781255],"study_design_scores_gemma":[0.00040878312,0.00020709395,0.056684423,0.00005277504,0.000008599056,0.00005099196,0.00011895437,0.8865494,0.0017385174,0.03011932,0.02341538,0.00064575445],"about_ca_topic_score_codex":0.0002098134,"about_ca_topic_score_gemma":0.000005507933,"teacher_disagreement_score":0.8971668,"about_ca_system_score_codex":0.0000062890167,"about_ca_system_score_gemma":0.00001893096,"threshold_uncertainty_score":0.99976903},"labels":[],"label_agreement":null},{"id":"W2953116807","doi":"10.1145/2858949.2784744","title":"Elaborating evaluation-order polymorphism","year":2015,"lang":"en","type":"preprint","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Programming language; Programmer; Value (mathematics); Order (exchange); Type (biology); Partial evaluation; Type inference; Program analysis; Semantics (computer science); Theoretical computer science; Artificial intelligence","score_opus":0.07490492165720401,"score_gpt":0.31833588582030625,"score_spread":0.24343096416310223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953116807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09045835,0.040479053,0.6157125,0.012344164,0.04892687,0.00781759,0.000068001056,0.004523114,0.17967036],"genre_scores_gemma":[0.9692197,0.000010634738,0.028895603,0.00024164989,0.00090312085,0.00012149254,0.00010963089,0.000026354077,0.00047184707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670136,0.00036603684,0.0004966945,0.0008905189,0.0011013837,0.00044403016],"domain_scores_gemma":[0.9960074,0.0002765937,0.0006136048,0.002211093,0.0007068287,0.00018447638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022608202,0.00036894222,0.0004226875,0.00016735206,0.00016839808,0.00093576434,0.0032956589,0.00036363633,0.000044507615],"category_scores_gemma":[0.0014979733,0.0003177738,0.000085079264,0.00038378173,0.000056883262,0.0004105799,0.0023678893,0.00051388366,0.00040436434],"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.00004414731,0.0006889574,0.020372802,0.0012255827,0.0011550914,0.00032252452,0.043361608,0.01883229,0.0003564216,0.3236455,0.06436886,0.52562624],"study_design_scores_gemma":[0.0021805854,0.0004117245,0.002954581,0.00018591472,0.00045246122,0.000058284782,0.0009555996,0.37066206,0.0005437585,0.5421497,0.07626131,0.003183967],"about_ca_topic_score_codex":0.0007519672,"about_ca_topic_score_gemma":0.00016803147,"teacher_disagreement_score":0.8787613,"about_ca_system_score_codex":0.00012055844,"about_ca_system_score_gemma":0.000950828,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W2953181121","doi":"10.1145/3140587.3062348","title":"HoTTSQL: proving query rewrites with univalent SQL semantics","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Alberta Innovates - Technology Futures; U.S. Department of Energy; National Science Foundation","keywords":"Computer science; SQL; Query optimization; Programming language; Query language; Conjunctive query; Query by Example; Sargable; Spatial query; Undecidable problem; Tuple; Null (SQL); Database; Theoretical computer science; Decidability; Relational database; Information retrieval; Web search query; Mathematics; Discrete mathematics","score_opus":0.025995750750134834,"score_gpt":0.26836799185769167,"score_spread":0.24237224110755684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953181121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.512901,0.00096041674,0.46140325,0.009300852,0.0019317998,0.0010383598,0.0001175871,0.0010365619,0.011310138],"genre_scores_gemma":[0.80499524,0.000030344498,0.19401912,0.00011368373,0.00018467654,0.0000110028295,0.00000973529,0.000017245324,0.0006189373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866754,0.000041377134,0.00020116918,0.00044215805,0.00030963894,0.00033813604],"domain_scores_gemma":[0.9966364,0.00021602827,0.0003507975,0.002602286,0.00009081487,0.00010366356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023744034,0.00019398257,0.00022599705,0.000059091864,0.00067279453,0.00043419425,0.0017205527,0.000047820537,0.0000063064863],"category_scores_gemma":[0.00037135603,0.00014298798,0.000033810273,0.00007106595,0.0001439771,0.0021375867,0.00083179324,0.0001386125,0.000041854804],"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.00016010828,0.00034496133,0.1866436,0.0013316344,0.00027944747,0.001629384,0.0056774765,0.0007466878,0.005875223,0.7120877,0.005146126,0.08007769],"study_design_scores_gemma":[0.004404003,0.001977737,0.2370141,0.0042303167,0.0002295206,0.00054337864,0.003281021,0.037548065,0.04074556,0.0061902497,0.6588828,0.0049532526],"about_ca_topic_score_codex":0.00032897425,"about_ca_topic_score_gemma":0.00048937835,"teacher_disagreement_score":0.7058974,"about_ca_system_score_codex":0.000019884488,"about_ca_system_score_gemma":0.000076467484,"threshold_uncertainty_score":0.58308804},"labels":[],"label_agreement":null},{"id":"W2997094414","doi":"10.1145/1837853.1693496","title":"Towards scalable and transparent parallelization of multiplayer games using transactional memory support","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Software transactional memory; Transactional memory; Scalability; Quake (natural phenomenon); Lock (firearm); Parallel computing; Distributed computing; Programming language; Operating system","score_opus":0.03942464060239884,"score_gpt":0.2844581110907729,"score_spread":0.24503347048837407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997094414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79243743,0.00006563415,0.20509496,0.0013251095,0.00043049362,0.00016720762,0.000014258385,0.00020457902,0.0002603191],"genre_scores_gemma":[0.8107203,0.00001074943,0.18909085,0.00008965472,0.000035563487,0.000006797178,0.0000048661504,0.0000074288832,0.000033788245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.00002255419,0.00024768576,0.00034012896,0.00031596737,0.00024668398],"domain_scores_gemma":[0.9990755,0.00013635488,0.000094301904,0.00052869844,0.00008294623,0.000082218234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023203717,0.00014497942,0.00020123352,0.00015215614,0.000081839804,0.00007343464,0.00088662206,0.00011866527,0.000041610885],"category_scores_gemma":[0.00010566331,0.00013333121,0.000036143803,0.00026402518,0.00009760457,0.00047299298,0.00011530991,0.0001678901,0.0000058880023],"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.00018149942,0.00054498063,0.047770787,0.00040077476,0.00026116698,0.00007337094,0.009411314,0.098359615,0.31971645,0.009518132,0.0025846802,0.51117724],"study_design_scores_gemma":[0.0022128187,0.00061151414,0.15538637,0.00016539652,0.00015348439,0.00015448034,0.00047135146,0.48750043,0.33701035,0.0064202514,0.008472507,0.0014410283],"about_ca_topic_score_codex":0.00011675828,"about_ca_topic_score_gemma":0.00022454478,"teacher_disagreement_score":0.50973624,"about_ca_system_score_codex":0.000012155285,"about_ca_system_score_gemma":0.00006576881,"threshold_uncertainty_score":0.54370886},"labels":[],"label_agreement":null},{"id":"W2997135906","doi":"10.1145/1932682.1869467","title":"Agility in context","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Agile software development; Grounded theory; Computer science; Context (archaeology); Knowledge management; Process management; Engineering management; Management science; Software engineering; Qualitative research; Sociology; Business; Engineering","score_opus":0.016823384574588145,"score_gpt":0.26893054062923694,"score_spread":0.2521071560546488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997135906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9360385,0.00014657874,0.055864204,0.0028443306,0.0012754777,0.000168582,0.0000030482997,0.00095716387,0.002702142],"genre_scores_gemma":[0.8883142,0.0000049182154,0.11133824,0.0002478851,0.000049440245,0.000008098527,0.0000010700378,0.0000045283164,0.000031634998],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993072,0.0000277581,0.00013534207,0.00022817781,0.00012257404,0.00017890806],"domain_scores_gemma":[0.9981875,0.00085275853,0.000054941505,0.00082732853,0.0000245852,0.00005288012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042689437,0.000088581975,0.000101969315,0.00007200106,0.00003351089,0.000121332894,0.0013047614,0.0000713761,0.000040299663],"category_scores_gemma":[0.001003868,0.00008035561,0.00002294973,0.00018875378,0.000023237528,0.00063687464,0.00024267906,0.0003216736,0.000052621563],"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.00004097197,0.00035948196,0.1837794,0.00011846722,0.00003811312,0.0002736798,0.004866522,0.00020163381,0.008636199,0.2045413,0.004803956,0.5923403],"study_design_scores_gemma":[0.00093832426,0.00027390238,0.46187845,0.00007778417,0.000015907279,0.000076603195,0.00011769664,0.03030135,0.017217932,0.042579483,0.44531268,0.0012098966],"about_ca_topic_score_codex":0.00030707195,"about_ca_topic_score_gemma":0.00063880393,"teacher_disagreement_score":0.5911304,"about_ca_system_score_codex":0.000007278759,"about_ca_system_score_gemma":0.000021407292,"threshold_uncertainty_score":0.32768068},"labels":[],"label_agreement":null},{"id":"W2998780350","doi":"10.1145/3093334.2989235","title":"Efficiently implementing the copy semantics of MATLAB's arrays in JavaScript","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; JavaScript; Programming language; Unobtrusive JavaScript; Compiler; MATLAB; Semantics (computer science); Source code; Program transformation; Leverage (statistics); Operating system; Rich Internet application; Artificial intelligence","score_opus":0.020773338509530243,"score_gpt":0.26858708977815793,"score_spread":0.24781375126862767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998780350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13408998,0.000079610116,0.85988665,0.0037021372,0.00018828643,0.00017970263,0.0000035650967,0.00019617063,0.0016739374],"genre_scores_gemma":[0.89705396,0.000016593947,0.10265212,0.0001642151,0.000023200168,0.000003974065,8.232927e-7,0.0000057480765,0.000079390484],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00009340438,0.00030662285,0.00022715905,0.00022236674,0.00027525966],"domain_scores_gemma":[0.9985019,0.0005090022,0.00020362157,0.0007017306,0.000055159424,0.00002861177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663001,0.00010253409,0.00014259823,0.00008744776,0.000088507586,0.00006984835,0.0015100684,0.00003594216,0.000018774945],"category_scores_gemma":[0.0002451578,0.000058898826,0.00003686259,0.00032347816,0.00005541425,0.00018560296,0.00056801445,0.00006319221,0.000019658737],"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.00009147561,0.0008687327,0.41389275,0.00035556982,0.00021364856,0.00008866692,0.022116046,0.047254257,0.038528316,0.16133906,0.08200437,0.23324713],"study_design_scores_gemma":[0.004162502,0.00078482414,0.059867207,0.0013307929,0.00007917082,0.00003954734,0.00075718825,0.49489883,0.35911205,0.029910682,0.047088996,0.0019682015],"about_ca_topic_score_codex":0.00006757709,"about_ca_topic_score_gemma":0.000032537515,"teacher_disagreement_score":0.76296395,"about_ca_system_score_codex":0.000016506992,"about_ca_system_score_gemma":0.000024472934,"threshold_uncertainty_score":0.2806108},"labels":[],"label_agreement":null},{"id":"W2999961398","doi":"10.1145/2007477.1952702","title":"Patch auditing in infrastructure as a service clouds","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Cloud computing; Hypervisor; Virtualization; Operating system; Overhead (engineering); Leverage (statistics); Software; Binary translation; Audit; Distributed computing; Computer security","score_opus":0.04106271506474883,"score_gpt":0.26092756814074175,"score_spread":0.2198648530759929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999961398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803231,0.00006010671,0.008569394,0.00096846285,0.0005970206,0.000111842695,0.00000182304,0.0002117756,0.009156504],"genre_scores_gemma":[0.94903237,0.0000039276874,0.049231127,0.001584716,0.00011898773,0.000005528413,0.0000030602862,0.000006868434,0.000013398408],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99885106,0.00007110134,0.00025359172,0.0003547747,0.00019273645,0.00027674905],"domain_scores_gemma":[0.9986952,0.00028568174,0.00016046446,0.0007166039,0.000072179304,0.00006986668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550148,0.00012748723,0.0001322561,0.00009264355,0.000115929346,0.000114786584,0.0018151868,0.00008921886,0.00009832242],"category_scores_gemma":[0.00025997267,0.00012607327,0.000025703053,0.0005817976,0.000020671243,0.00047364912,0.00046624543,0.00022908032,0.00017075721],"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.00007519846,0.00033515354,0.35225445,0.00037785035,0.0000827123,0.00028852187,0.20861515,0.0015852038,0.0012752317,0.29387084,0.0025227426,0.13871692],"study_design_scores_gemma":[0.0014127207,0.00023256717,0.62045395,0.00036016505,0.000023431367,0.00012450264,0.0034907958,0.21579498,0.009507809,0.13536856,0.011896487,0.0013340167],"about_ca_topic_score_codex":0.0010591607,"about_ca_topic_score_gemma":0.00023736729,"teacher_disagreement_score":0.26819953,"about_ca_system_score_codex":0.000025745117,"about_ca_system_score_gemma":0.00006281793,"threshold_uncertainty_score":0.5141119},"labels":[],"label_agreement":null},{"id":"W3000303863","doi":"10.1145/504311.504308","title":"Controlling garbage collection and heap growth to reduce the execution time of Java applications","year":2001,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Waterloo","funders":"","keywords":"Garbage collection; Garbage; Manual memory management; Computer science; Heap (data structure); Memory leak; Java; Operating system; Memory footprint; Virtual machine; Database; Parallel computing; Programming language","score_opus":0.01932782462127499,"score_gpt":0.2508392103389931,"score_spread":0.2315113857177181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000303863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15761857,0.0011504587,0.8198661,0.005724098,0.00045068446,0.002043216,0.0000033429017,0.00030557878,0.012837919],"genre_scores_gemma":[0.9972293,0.000021423688,0.0020165727,0.00013103346,0.00010647835,0.000060150454,0.000002482911,0.0000042545676,0.00042833886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992511,0.00006376391,0.00017487956,0.00021678301,0.00014579475,0.00014767612],"domain_scores_gemma":[0.99911803,0.00025217969,0.00011481521,0.0003765087,0.000085733525,0.000052703792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034781697,0.00007840061,0.00012379824,0.00006074787,0.00020165085,0.00011265773,0.00047616308,0.000040175888,0.000004464587],"category_scores_gemma":[0.000098766555,0.00005553019,0.000024491657,0.00037795815,0.000038485097,0.00015865448,0.00009765399,0.00005329735,0.000040611678],"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.0003426124,0.00066867465,0.028146788,0.00033675073,0.00034188107,0.000029322928,0.027180083,0.0010916755,0.07673848,0.715632,0.013730496,0.13576122],"study_design_scores_gemma":[0.008349903,0.0042467928,0.10521825,0.00019291318,0.000555713,0.0007055473,0.004233197,0.20226198,0.07267239,0.18674405,0.41146675,0.0033525235],"about_ca_topic_score_codex":0.0002913751,"about_ca_topic_score_gemma":0.000039192884,"teacher_disagreement_score":0.8396107,"about_ca_system_score_codex":0.000015590544,"about_ca_system_score_gemma":0.00002274664,"threshold_uncertainty_score":0.22644553},"labels":[],"label_agreement":null},{"id":"W3003432522","doi":"10.1145/2248487.2150989","title":"Cosmic rays don't strike twice","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dram; Computer science; Set (abstract data type); Terabyte; Memory errors; Field (mathematics); Soft error; Range (aeronautics); Reliability engineering; Computer hardware; Operating system; Programming language","score_opus":0.010329532402595945,"score_gpt":0.22628673296165122,"score_spread":0.21595720055905526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003432522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98183715,0.003453624,0.00078853394,0.00008702553,0.0013614193,0.0001785435,0.000015241846,0.0006189047,0.011659578],"genre_scores_gemma":[0.99805266,0.00004685226,0.0011353397,0.00012734288,0.00047228893,0.000013657004,0.000022255812,0.000042222295,0.00008739459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990272,0.000034478635,0.00015525936,0.00011084517,0.00016949906,0.00050269556],"domain_scores_gemma":[0.998925,0.0004769153,0.000038034646,0.00042877646,0.000015296862,0.00011601829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021853582,0.00015527965,0.00014136912,0.000075088676,0.000054025437,0.0000375717,0.00035896775,0.00008908532,0.00015471672],"category_scores_gemma":[0.00017990533,0.00015636034,0.000035797635,0.0001658432,0.000020921801,0.00037198205,0.000033045373,0.0002115544,0.00044695183],"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.000059004084,0.00019859202,0.03085115,0.0005526022,0.00050226954,0.000015808248,0.0036596889,0.79491895,0.020420797,0.0066375346,0.08285824,0.059325375],"study_design_scores_gemma":[0.002152237,0.00035399993,0.062355876,0.000099843106,0.00033661493,0.000056135672,0.0004206981,0.30600336,0.049318206,0.0012426549,0.5754876,0.0021727346],"about_ca_topic_score_codex":0.000017943883,"about_ca_topic_score_gemma":0.000019681198,"teacher_disagreement_score":0.49262938,"about_ca_system_score_codex":0.00009794703,"about_ca_system_score_gemma":0.000013581375,"threshold_uncertainty_score":0.63761896},"labels":[],"label_agreement":null},{"id":"W3003638206","doi":"10.1145/2858965.2814272","title":"Static analysis of event-driven Node.js JavaScript applications","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"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; JavaScript; Event (particle physics); Asynchronous communication; Callback; Suite; Node (physics); Programming language; False positive paradox; Operating system; Computer network; Artificial intelligence","score_opus":0.06467412276819863,"score_gpt":0.3154442103194611,"score_spread":0.2507700875512625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003638206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04107443,0.00018874592,0.95563626,0.001146225,0.00021798047,0.00018812391,0.00001970367,0.000141383,0.001387155],"genre_scores_gemma":[0.93448746,0.0000051110505,0.065076746,0.00029330657,0.00004465982,0.000020590543,0.00002914519,0.000004602815,0.00003834837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987579,0.00008371214,0.00034053338,0.0003109075,0.0003328243,0.00017413442],"domain_scores_gemma":[0.99791193,0.00039048606,0.00026604134,0.0011095646,0.00020455086,0.00011742336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035966843,0.000099989484,0.00022376473,0.00026875496,0.00008435727,0.00009510845,0.0015891534,0.00004422149,0.000015382646],"category_scores_gemma":[0.00019826912,0.00009830991,0.00008557984,0.0014308052,0.00004872773,0.0003131249,0.00025804352,0.000081423954,0.00006235818],"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.000046018806,0.00142263,0.13335803,0.00028589097,0.0038713526,0.000019997851,0.05043469,0.33147854,0.0021781316,0.3756104,0.016647946,0.08464635],"study_design_scores_gemma":[0.00032644966,0.00006425692,0.014258908,0.000018727875,0.0003858276,0.0000019858765,0.0005494297,0.9634152,0.0010714823,0.0038854983,0.015748693,0.00027353497],"about_ca_topic_score_codex":0.0001258889,"about_ca_topic_score_gemma":0.000039607094,"teacher_disagreement_score":0.89341307,"about_ca_system_score_codex":0.000029446253,"about_ca_system_score_gemma":0.00008455559,"threshold_uncertainty_score":0.40089616},"labels":[],"label_agreement":null},{"id":"W3003730485","doi":"10.1145/2168696.2047858","title":"Bootstrapping a self-hosted research virtual machine for JavaScript","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Programming language; Rich Internet application; Virtual machine; Bytecode; Bootstrapping (finance); Operating system; Interpreter; Web application","score_opus":0.14326264038785352,"score_gpt":0.34024353194325196,"score_spread":0.19698089155539844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003730485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011552545,0.00027563653,0.9752388,0.000492487,0.00036542155,0.0005264245,0.000007930132,0.0018209934,0.009719781],"genre_scores_gemma":[0.6548859,0.00001717992,0.34450686,0.00019569648,0.00007159232,0.00003649255,0.000007510823,0.000013315232,0.0002654854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833316,0.0001600534,0.00026343833,0.00045601666,0.00032504371,0.00046232084],"domain_scores_gemma":[0.9981077,0.0005732524,0.000100959136,0.00086118566,0.00024568354,0.0001112438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011363433,0.0001476471,0.00017258253,0.00026799875,0.0003399374,0.00018230916,0.0021084005,0.000092826456,0.000015589629],"category_scores_gemma":[0.00040716233,0.0001360351,0.00006101503,0.00044895028,0.000053686388,0.00040715132,0.00051254994,0.00021415825,0.000038300983],"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.0005718782,0.0026827022,0.013989699,0.00065466354,0.0008444692,0.00022685505,0.07807303,0.0053693485,0.00442645,0.5208956,0.1497161,0.22254917],"study_design_scores_gemma":[0.0010646303,0.0014822218,0.0023479275,0.000116909476,0.000024958186,0.00002066214,0.00019335884,0.93890315,0.01433447,0.017784683,0.023014132,0.0007129041],"about_ca_topic_score_codex":0.0001361491,"about_ca_topic_score_gemma":0.000015779277,"teacher_disagreement_score":0.9335338,"about_ca_system_score_codex":0.000028816576,"about_ca_system_score_gemma":0.000071952854,"threshold_uncertainty_score":0.55473506},"labels":[],"label_agreement":null},{"id":"W3004099993","doi":"10.1145/2499370.2462168","title":"Dynamic determinacy analysis","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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; Static analysis; Programming language; JavaScript; Soundness; Determinacy; Program analysis; Functional programming; Leverage (statistics); Source code; Scalability; Theoretical computer science; Operating system; Artificial intelligence","score_opus":0.014623327021583827,"score_gpt":0.2669698366788959,"score_spread":0.2523465096573121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004099993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5483116,0.00020543754,0.43200195,0.0018229353,0.00025101352,0.0002437019,0.000003042766,0.015357362,0.0018029984],"genre_scores_gemma":[0.69096047,0.0000021393962,0.3086038,0.00027885937,0.000011387727,0.000018420622,0.0000034048783,0.00000509248,0.000116431846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898475,0.000044160824,0.000175346,0.00034229545,0.00019353948,0.0002598999],"domain_scores_gemma":[0.9977479,0.0007345052,0.00010206521,0.0012582878,0.00007139637,0.000085875225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016162063,0.00012909525,0.00018258936,0.00025601356,0.00010305503,0.0003218251,0.0017428516,0.000053101852,0.000052455274],"category_scores_gemma":[0.00057043385,0.00010982728,0.000085820626,0.000766006,0.000034354885,0.0005294134,0.00038605568,0.00009339131,0.0002948805],"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.0000045396655,0.00020493219,0.35981765,0.00007220017,0.000573984,0.000119860975,0.002205783,0.0005020872,0.0007218871,0.0018752421,0.03933586,0.594566],"study_design_scores_gemma":[0.00014986082,0.00013508649,0.2869634,0.000032879798,0.00018742312,0.000018896675,0.0000129846085,0.63646746,0.00047282493,0.074385285,0.0006209712,0.00055289356],"about_ca_topic_score_codex":0.00059493474,"about_ca_topic_score_gemma":0.000042407835,"teacher_disagreement_score":0.6359654,"about_ca_system_score_codex":0.000020585538,"about_ca_system_score_gemma":0.00001845244,"threshold_uncertainty_score":0.44786263},"labels":[],"label_agreement":null},{"id":"W3005043524","doi":"10.1145/996893.996860","title":"Symbolic pointer analysis revisited","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"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; Pointer (user interface); Pointer analysis; Compiler; Call graph; Theoretical computer science; Binary decision diagram; Programming language; Symbolic execution; Optimizing compiler; Static analysis; Algorithm; Software; Artificial intelligence","score_opus":0.02748096730214771,"score_gpt":0.3031241112063783,"score_spread":0.27564314390423056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005043524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1783404,0.00019573043,0.81473386,0.0014511633,0.0002923093,0.00014472728,0.000006389581,0.00038757967,0.004447844],"genre_scores_gemma":[0.5727628,0.000006709938,0.42669505,0.0004214739,0.000044526365,0.0000044298517,0.000008443379,0.0000046521127,0.000051902345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99885696,0.00008590986,0.0002394614,0.0003499129,0.00024202764,0.00022570998],"domain_scores_gemma":[0.99822944,0.00011952828,0.00013817806,0.0013688647,0.00006671145,0.000077293065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004317612,0.00011884693,0.00019619706,0.00028333184,0.000085338244,0.00018259857,0.0017008013,0.000056073277,0.000037733433],"category_scores_gemma":[0.00043405258,0.00010430806,0.00010329552,0.0013826042,0.000035423054,0.0006657944,0.00026397387,0.00010909383,0.00028856745],"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.000052074058,0.00033784192,0.025821343,0.00014446487,0.0013530485,0.000094428324,0.009207192,0.0117987245,0.0038222177,0.8875311,0.0011599254,0.058677655],"study_design_scores_gemma":[0.0037212088,0.00075171667,0.63551986,0.00028551865,0.0018171662,0.00008930137,0.00040425608,0.15275322,0.07563352,0.09922551,0.027001722,0.0027969903],"about_ca_topic_score_codex":0.00006276866,"about_ca_topic_score_gemma":0.00001511121,"teacher_disagreement_score":0.7883056,"about_ca_system_score_codex":0.000043600583,"about_ca_system_score_gemma":0.000023409671,"threshold_uncertainty_score":0.42535594},"labels":[],"label_agreement":null},{"id":"W3005050519","doi":"10.1145/2980983.2908096","title":"From Datalog to flix: a declarative language for fixed points on lattices","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Datalog; Computer science; Programming language; Semantics (computer science); Syntax; Compiler; Declarative programming; Theoretical computer science; Programming paradigm; Artificial intelligence; Inductive programming","score_opus":0.043924621764717446,"score_gpt":0.2999157988836089,"score_spread":0.25599117711889147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005050519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35315752,0.00035776006,0.62807274,0.009361824,0.0024831388,0.001616183,0.00031199542,0.0006569075,0.003981909],"genre_scores_gemma":[0.96865356,0.000001535329,0.029396776,0.0008236697,0.00038794827,0.00006282266,0.000035419722,0.0000123189675,0.0006259317],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986255,0.00007891463,0.00019913663,0.0005348153,0.0002299023,0.00033171903],"domain_scores_gemma":[0.99721646,0.0014747283,0.00013113294,0.0009888952,0.000053801024,0.00013500584],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002821944,0.00017224831,0.00021336552,0.00007795012,0.00010913204,0.00021707869,0.0015976154,0.000075050615,0.00003336915],"category_scores_gemma":[0.00070054276,0.00010425785,0.000054563767,0.0001366411,0.000030956286,0.00046449143,0.00031730463,0.000052406667,0.0008074815],"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.00050524645,0.00056893635,0.008118883,0.00016166893,0.00052324706,0.00025533763,0.059646197,0.000022490363,0.027466672,0.37067538,0.04766801,0.48438793],"study_design_scores_gemma":[0.009624802,0.006137772,0.030024732,0.0004539866,0.00021943041,0.000025801033,0.0045922673,0.0031419562,0.13731253,0.21103686,0.59358335,0.0038464905],"about_ca_topic_score_codex":0.00032517608,"about_ca_topic_score_gemma":0.00040504418,"teacher_disagreement_score":0.61549604,"about_ca_system_score_codex":0.000026217092,"about_ca_system_score_gemma":0.00002944606,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W3005147209","doi":"10.1145/2775051.2676992","title":"Principal Type Schemes for Gradual Programs","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Type inference; Computer science; Inference; Programming language; Correctness; Static analysis; System F; Type (biology); Type theory; Modular design; Theoretical computer science; Subtyping; Artificial intelligence; Lambda calculus","score_opus":0.1119697619469658,"score_gpt":0.310158053476333,"score_spread":0.19818829152936723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005147209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3618617,0.004155885,0.5775871,0.004639448,0.014602388,0.005089331,0.0000077590885,0.0037197485,0.028336637],"genre_scores_gemma":[0.962451,0.000001700716,0.03630156,0.000105498875,0.0003510369,0.000052417152,0.000019961499,0.000012005902,0.0007048208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987167,0.0000424278,0.00020194665,0.00036193486,0.00029469197,0.0003822928],"domain_scores_gemma":[0.99869406,0.000121195306,0.00012239165,0.0006745866,0.00020494565,0.0001828293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047933898,0.0001503944,0.00018185105,0.000051099283,0.00009415143,0.0003213886,0.0013292173,0.00008178671,0.000002290222],"category_scores_gemma":[0.00040583836,0.00011596185,0.000054231507,0.00023949188,0.000049861213,0.00037723893,0.00029731603,0.00008041566,0.00015468056],"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.000076693555,0.00032934052,0.027509117,0.00017476696,0.00011794038,0.000041994845,0.0056438907,0.000022293914,0.00010817839,0.7272767,0.0063175047,0.23238157],"study_design_scores_gemma":[0.0010274551,0.0012631452,0.00061312114,0.000009710539,0.000027332402,0.000025809477,0.0002706845,0.004734312,0.00082561036,0.0322022,0.95854473,0.00045587687],"about_ca_topic_score_codex":0.000072597635,"about_ca_topic_score_gemma":0.000059964063,"teacher_disagreement_score":0.95222723,"about_ca_system_score_codex":0.00002355554,"about_ca_system_score_gemma":0.000113545735,"threshold_uncertainty_score":0.47287866},"labels":[],"label_agreement":null},{"id":"W3005150256","doi":"10.1145/2775051.2677012","title":"Proof Spaces for Unbounded Parallelism","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Correctness; Separation logic; Mathematical proof; Soundness; Gas meter prover; Automated theorem proving; Abstract interpretation; Theoretical computer science; Programming language; Formal proof; TRACE (psycholinguistics); Hoare logic; Axiom; Mathematics","score_opus":0.07243827479088721,"score_gpt":0.2919481229640843,"score_spread":0.21950984817319708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005150256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037982684,0.0026649486,0.9199027,0.008054277,0.005217681,0.0021506923,0.000006431645,0.0010224492,0.022998126],"genre_scores_gemma":[0.9701814,0.0000020633097,0.02792936,0.00021852177,0.00032170254,0.00006731955,0.000008895843,0.0000099550125,0.0012607645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988022,0.0000525488,0.00019004392,0.00034910304,0.00026661542,0.00033949292],"domain_scores_gemma":[0.9986471,0.00021786083,0.00014176709,0.0007042145,0.000132064,0.00015698282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050104223,0.00014317309,0.00019131732,0.000056984365,0.00010901336,0.00045830183,0.0013840721,0.000080146456,0.00000360613],"category_scores_gemma":[0.00037237856,0.00010886099,0.000055449756,0.00015493498,0.000045476787,0.00045599867,0.0002289491,0.00006636161,0.00010415052],"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.00005170524,0.00017439634,0.005028197,0.00016131971,0.00009458394,0.00003820147,0.009314754,0.00021438912,0.00010573606,0.91452694,0.03194454,0.03834522],"study_design_scores_gemma":[0.0016973376,0.00081650726,0.0005616351,0.000011243796,0.000033046937,0.000027998805,0.0007096259,0.010582312,0.0017121176,0.31622085,0.6670128,0.000614534],"about_ca_topic_score_codex":0.00014365597,"about_ca_topic_score_gemma":0.00012409445,"teacher_disagreement_score":0.93219876,"about_ca_system_score_codex":0.000024323797,"about_ca_system_score_gemma":0.00009630942,"threshold_uncertainty_score":0.44392225},"labels":[],"label_agreement":null},{"id":"W3005298591","doi":"10.1145/2817817.2731196","title":"Exploring VM Introspection","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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; Consistency (knowledge bases); Consistency model; Introspection; Set (abstract data type); Variety (cybernetics); Overhead (engineering); Cache coherence; Context (archaeology); Distributed computing; Artificial intelligence; Cache; Operating system; CPU cache; Data consistency; Programming language","score_opus":0.34020168751679947,"score_gpt":0.3039877899886589,"score_spread":0.03621389752814058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005298591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6678224,0.00022328258,0.31404752,0.003952689,0.0045774938,0.00013892353,0.0000010546604,0.0009286194,0.008307995],"genre_scores_gemma":[0.96137905,0.0000073086135,0.03799093,0.00019797019,0.00037600182,0.0000089123705,0.0000017855966,0.000004460568,0.000033596465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991951,0.000039633273,0.00014268789,0.0002444178,0.00021453478,0.00016360258],"domain_scores_gemma":[0.9990087,0.00016057359,0.00007674609,0.00057959417,0.00007760901,0.00009676447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000329577,0.00007542503,0.000079443795,0.000070774826,0.00010925117,0.00021445808,0.0009383919,0.000025940093,0.0000059838426],"category_scores_gemma":[0.00036995494,0.000074531315,0.00002172986,0.00027455564,0.000018298819,0.0010971286,0.00025531012,0.00009943867,0.00022526977],"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.00004103818,0.0002658517,0.025036575,0.000071418806,0.00007339346,0.00005355849,0.04167055,0.0067020734,0.0012970066,0.69098616,0.0126226535,0.22117971],"study_design_scores_gemma":[0.0027518636,0.0007903054,0.07529084,0.00018699918,0.00004680172,0.00014177787,0.004562058,0.5352979,0.03643082,0.09384818,0.2486,0.002052499],"about_ca_topic_score_codex":0.00006298092,"about_ca_topic_score_gemma":0.000008484879,"teacher_disagreement_score":0.597138,"about_ca_system_score_codex":0.000040527993,"about_ca_system_score_gemma":0.000032987897,"threshold_uncertainty_score":0.3039299},"labels":[],"label_agreement":null},{"id":"W3005412289","doi":"10.1145/354222.353189","title":"Practical virtual method call resolution for Java","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bytecode; Call graph; Java; Program analysis; Static analysis; Variable (mathematics); Benchmark (surveying); Class hierarchy; Call stack; Theoretical computer science; Hierarchy; Dependence analysis; Class (philosophy); Programming language; Algorithm; Computer engineering; Object-oriented programming; Artificial intelligence","score_opus":0.060525375415719375,"score_gpt":0.3429938513744404,"score_spread":0.282468475958721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005412289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015551455,0.00009994361,0.9877062,0.0023398253,0.0005594414,0.0003591681,0.000002848976,0.00024597207,0.0071314764],"genre_scores_gemma":[0.64168197,0.0000076224565,0.3546941,0.00042907102,0.00039576765,0.00004325415,0.000012045099,0.000011676535,0.0027244962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856335,0.00017075219,0.00023869927,0.00041295268,0.0002533374,0.0003609261],"domain_scores_gemma":[0.99807954,0.0010009443,0.00010030759,0.0006451492,0.000064443426,0.00010958845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015313,0.00013484454,0.00018008948,0.00004819782,0.00017132988,0.00022969487,0.00079185993,0.00011507114,0.000057229714],"category_scores_gemma":[0.00048595367,0.00010938058,0.000071775736,0.00015772988,0.000035978897,0.00052400585,0.000110089466,0.00011979687,0.0003111536],"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.00010351104,0.00019794423,0.0003083603,0.000053051284,0.00006771935,0.000048357753,0.0019018678,0.000349454,0.00024743527,0.6199812,0.028876737,0.34786433],"study_design_scores_gemma":[0.0009684415,0.0010293963,0.0008132626,0.000009129275,0.00005513541,0.00010341744,0.00012960692,0.107660055,0.0010645948,0.021545537,0.86610496,0.00051648216],"about_ca_topic_score_codex":0.00017631808,"about_ca_topic_score_gemma":0.00006409672,"teacher_disagreement_score":0.8372282,"about_ca_system_score_codex":0.000026758395,"about_ca_system_score_gemma":0.00006385519,"threshold_uncertainty_score":0.44604105},"labels":[],"label_agreement":null},{"id":"W3005523836","doi":"10.1145/583854.582436","title":"Design pattern implementation in Java and aspectJ","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"AspectJ; Computer science; Modularity (biology); Programming language; Composability; Java; Software design pattern; Reusability; Locality; Implementation; Design pattern; Aspect-oriented programming; Object-oriented programming; Compiler; Software engineering; Software","score_opus":0.08859055418377597,"score_gpt":0.319533329656488,"score_spread":0.23094277547271203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005523836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03340803,0.0003540844,0.9653675,0.00042052913,0.00013505433,0.00010237171,8.417032e-7,0.00017597296,0.0000356236],"genre_scores_gemma":[0.5442417,0.00003099565,0.45560074,0.00008506795,0.000018981667,0.000007523735,6.014584e-7,0.0000046522164,0.000009700566],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992308,0.00010385687,0.00013489489,0.00023320243,0.00010498432,0.00019227629],"domain_scores_gemma":[0.99831706,0.0012650419,0.00004799083,0.00032649655,0.000011704352,0.000031726864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028883584,0.00009263728,0.00010335004,0.00009255554,0.00003330082,0.0000659661,0.00046551603,0.000029729175,0.000023093407],"category_scores_gemma":[0.00033724547,0.00008872749,0.000008926904,0.00015366345,0.000017146604,0.0004493022,0.00017301226,0.00008050971,0.000018695673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033332183,0.000030662955,0.020102307,0.00003831607,0.00001505103,0.000089374626,0.005900722,0.027979564,0.0013592324,0.00087412616,0.00044887757,0.94315845],"study_design_scores_gemma":[0.0046788505,0.0012803896,0.48776972,0.00020085191,0.000046406043,0.00013710346,0.0017300351,0.35067007,0.044590306,0.104020484,0.0021488853,0.002726898],"about_ca_topic_score_codex":0.00003192078,"about_ca_topic_score_gemma":0.000026168149,"teacher_disagreement_score":0.94043154,"about_ca_system_score_codex":0.000020765905,"about_ca_system_score_gemma":0.000003728366,"threshold_uncertainty_score":0.3618202},"labels":[],"label_agreement":null},{"id":"W3006309927","doi":"10.1145/3140587.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Divide and conquer algorithms; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Theoretical computer science; Set (abstract data type)","score_opus":0.033256249219077605,"score_gpt":0.29474834922124826,"score_spread":0.26149210000217066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006309927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046204522,0.00031489998,0.9455483,0.0035074356,0.00022722487,0.00029939375,0.000012847932,0.00025521353,0.0036301403],"genre_scores_gemma":[0.78806454,0.00003660789,0.21165821,0.00009013415,0.000034567438,0.000014325787,0.0000010597992,0.0000046594037,0.00009587894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993402,0.000026559326,0.0001624036,0.0002259722,0.000100283774,0.00014458717],"domain_scores_gemma":[0.9980036,0.0007354851,0.00025108075,0.00088684115,0.00007648964,0.00004651141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027569846,0.00009080988,0.00017565791,0.00004705188,0.0002602573,0.00021224472,0.0013809428,0.000051692816,0.0000025927893],"category_scores_gemma":[0.0011222068,0.00007910764,0.00003353158,0.00002351116,0.0000919616,0.00033255425,0.00040796836,0.000039089155,0.0000022764596],"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.00015929657,0.00037010477,0.074451596,0.00087755325,0.00038838235,0.000034249664,0.0038989116,0.005683405,0.0022042287,0.34240678,0.036779236,0.53274626],"study_design_scores_gemma":[0.0022817927,0.0006721967,0.12503718,0.00067527784,0.00017884703,0.000029449227,0.0000749843,0.57789624,0.14139254,0.119506806,0.030514695,0.0017400006],"about_ca_topic_score_codex":0.000063884894,"about_ca_topic_score_gemma":0.000008731606,"teacher_disagreement_score":0.74186003,"about_ca_system_score_codex":0.0000037130178,"about_ca_system_score_gemma":0.00001819598,"threshold_uncertainty_score":0.3225916},"labels":[],"label_agreement":null},{"id":"W3007153607","doi":"10.1145/3156685.3092256","title":"Analyzing memory management methods on integrated CPU-GPU systems","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"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; CUDA; Central processing unit; Shared memory; Memory management; Multi-core processor; Parallel computing; Software; CPU shielding; Embedded system; Computer architecture; Operating system; Overlay","score_opus":0.04683664990969114,"score_gpt":0.3514376544596579,"score_spread":0.30460100454996675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007153607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020843882,0.00018794047,0.96374506,0.00059893297,0.0008360737,0.00020697924,0.0000017843342,0.00068592245,0.031652912],"genre_scores_gemma":[0.44547632,0.00003174511,0.55321676,0.00012727949,0.00006760502,0.000014160052,0.000004409103,0.00001036188,0.0010513315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985477,0.00023622862,0.00026408746,0.0004648943,0.00021443737,0.0002726622],"domain_scores_gemma":[0.9970402,0.0002889672,0.0003430284,0.0021634114,0.000079868754,0.00008448945],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010045064,0.00018700113,0.00023563282,0.00020041791,0.0005723175,0.0010987673,0.0034345328,0.00007178786,0.0000059337704],"category_scores_gemma":[0.00023878687,0.00015646116,0.000058017777,0.00015182699,0.000049874918,0.0004167127,0.0007397866,0.00016403674,0.000055106757],"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.000050379225,0.00024330096,0.0027778614,0.00028871183,0.00043650242,0.00026231635,0.0012841135,0.10224782,0.00035646302,0.099247016,0.019848904,0.7729566],"study_design_scores_gemma":[0.00049944676,0.00018576607,0.0052284836,0.0004024878,0.000050288432,0.00000991924,0.00012506498,0.97287804,0.003775283,0.0021148683,0.014076032,0.0006543162],"about_ca_topic_score_codex":0.00016288499,"about_ca_topic_score_gemma":0.0000054382376,"teacher_disagreement_score":0.8706302,"about_ca_system_score_codex":0.000040653173,"about_ca_system_score_gemma":0.000018306837,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W3007439791","doi":"10.1145/3155284.3018762","title":"Contention in Structured Concurrency","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; National Science Foundation","keywords":"Computer science; Concurrency; Data structure; Concurrent data structure; Theoretical computer science; Isolation (microbiology); Key (lock); Parallel computing; Directed acyclic graph; Distributed computing; Programming language; Algorithm","score_opus":0.039003094431741485,"score_gpt":0.3089167678228088,"score_spread":0.2699136733910673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007439791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34166563,0.00040992541,0.63413197,0.0032065408,0.0018075014,0.00041032518,0.0000071384343,0.0009034231,0.017457532],"genre_scores_gemma":[0.9391079,0.000012479462,0.06064637,0.00008913038,0.000036581445,0.0000037371863,0.000003485212,0.0000032925198,0.00009701753],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99927765,0.000041189465,0.00016177149,0.00023661446,0.0001232389,0.00015954302],"domain_scores_gemma":[0.9986739,0.00007704518,0.00019516115,0.00096931926,0.000046971458,0.00003758658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019027111,0.0000860715,0.00011749893,0.000076523465,0.00020851793,0.00038736095,0.0019939318,0.000051704243,0.000008581252],"category_scores_gemma":[0.00041418482,0.00007889163,0.00002604664,0.000055230914,0.000042319483,0.00056945335,0.00035689937,0.00009634222,0.000016178814],"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.000047469242,0.00024421953,0.34190893,0.00011711447,0.000061885825,0.00017243571,0.003984462,0.0056286305,0.0025222853,0.22784297,0.009865284,0.40760434],"study_design_scores_gemma":[0.0016938369,0.00017801787,0.60338694,0.00019392626,0.0000105631725,0.000013610073,0.00004506274,0.33888802,0.0071001006,0.043828025,0.0039477395,0.0007141628],"about_ca_topic_score_codex":0.00012537614,"about_ca_topic_score_gemma":0.00007473629,"teacher_disagreement_score":0.59744227,"about_ca_system_score_codex":0.000012954409,"about_ca_system_score_gemma":0.00002162796,"threshold_uncertainty_score":0.37353307},"labels":[],"label_agreement":null},{"id":"W3009278385","doi":"10.1145/3022670.2951929","title":"Indexed codata types","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Guard (computer science); Data type; Type (biology); Matching (statistics); Continuation; Programming language; Semantics (computer science); Pattern matching; Key (lock); Dual (grammatical number); Theoretical computer science; Mathematics","score_opus":0.036662071737814446,"score_gpt":0.26091697687180315,"score_spread":0.2242549051339887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009278385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11716658,0.002449354,0.77821445,0.015580383,0.008111608,0.0011483644,0.000029519388,0.0026755421,0.0746242],"genre_scores_gemma":[0.99515265,0.000010438331,0.0031900192,0.00019360446,0.00017820961,0.000007323749,0.0000029060773,0.0000067845253,0.0012580378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899656,0.00005379197,0.0001552993,0.00031593998,0.00021335886,0.00026504224],"domain_scores_gemma":[0.9984645,0.0003128709,0.000098273034,0.0009954236,0.000046152974,0.0000827745],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025927447,0.00010998632,0.00013370672,0.000058359412,0.0000817216,0.00015795288,0.0017691399,0.00006448895,0.00005415433],"category_scores_gemma":[0.00027403084,0.000063170075,0.000032512962,0.0001606097,0.000047666395,0.00049639127,0.0004231862,0.000049766822,0.0011178752],"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.00001760861,0.00010038494,0.043093856,0.000053673706,0.00008468707,0.000084935426,0.0011144473,0.0000030249462,0.0027876897,0.6119558,0.014017,0.3266869],"study_design_scores_gemma":[0.0017541883,0.0005331468,0.028542874,0.00005104947,0.00004228073,0.00006129579,0.000109042674,0.000748186,0.010615163,0.103381954,0.8530543,0.0011065062],"about_ca_topic_score_codex":0.000081388775,"about_ca_topic_score_gemma":0.00006508214,"teacher_disagreement_score":0.8779861,"about_ca_system_score_codex":0.000014544131,"about_ca_system_score_gemma":0.000035143086,"threshold_uncertainty_score":0.9996599},"labels":[],"label_agreement":null},{"id":"W3009600509","doi":"10.1145/2714064.2660222","title":"Confined gradual typing","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Computer science; Typing; Programming language; Control flow; Flexibility (engineering); Overhead (engineering); Code (set theory); Reliability (semiconductor); Smalltalk; Exception handling; Object-oriented programming; Mathematics","score_opus":0.033215729492108555,"score_gpt":0.2554272554673563,"score_spread":0.22221152597524774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009600509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06789552,0.00050827506,0.83427155,0.00392358,0.004267121,0.00046876376,0.000001232694,0.0013425854,0.08732137],"genre_scores_gemma":[0.99367994,0.0000018518922,0.0051262765,0.00049401884,0.00027887672,0.000006575421,0.0000040077475,0.0000068911736,0.00040155297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990017,0.0000859772,0.00017177181,0.00029562792,0.00016712672,0.00027782976],"domain_scores_gemma":[0.99876964,0.0002875604,0.00010645006,0.00070460525,0.00004652604,0.00008523883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039014287,0.00011779576,0.00015697426,0.000055220742,0.0001243338,0.00024821996,0.0012262964,0.00005809025,0.00001685696],"category_scores_gemma":[0.00027922998,0.000094029696,0.00004184554,0.00015141424,0.000037487203,0.00024631878,0.00023177319,0.000088023335,0.00039986224],"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.0000044920384,0.000033775363,0.0043591717,0.00004041214,0.000024118292,0.000009620799,0.0010555204,0.000022285984,0.0003084061,0.9203109,0.0017190508,0.07211222],"study_design_scores_gemma":[0.0016075018,0.0007453637,0.017010834,0.000028820019,0.000046712485,0.000070594295,0.0002598251,0.040133573,0.003661173,0.12772208,0.8074974,0.0012161253],"about_ca_topic_score_codex":0.00014295217,"about_ca_topic_score_gemma":0.00007096324,"teacher_disagreement_score":0.9257844,"about_ca_system_score_codex":0.000008679331,"about_ca_system_score_gemma":0.000021290303,"threshold_uncertainty_score":0.51395535},"labels":[],"label_agreement":null},{"id":"W3010046448","doi":"10.1145/1035292.1028992","title":"Resolving feature convolution in middleware systems","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"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; Middleware (distributed applications); Message oriented middleware; Modularity (biology); Architectural style; Aspect-oriented programming; Distributed computing; Personalization; Common Object Request Broker Architecture; Decomposition; Separation of concerns; Remote procedure call; Architecture; Embedded system; Programming language; Software architecture; Software","score_opus":0.04140691770923531,"score_gpt":0.2776183251013048,"score_spread":0.23621140739206947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010046448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039491657,0.0024167255,0.9554913,0.0006857441,0.0010607652,0.00015671927,0.000002840618,0.000597069,0.00009717025],"genre_scores_gemma":[0.5347076,0.00001563778,0.46508688,0.000045597568,0.000064591215,0.000011845636,0.000002943766,0.00000878472,0.000056122477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988872,0.00008925957,0.00016881553,0.00034136145,0.0001969984,0.00031636306],"domain_scores_gemma":[0.99823636,0.00087533065,0.00008284829,0.0007128418,0.000040879884,0.000051722596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003980101,0.00014590046,0.00019185105,0.00014572869,0.00006362842,0.00010669389,0.0011163855,0.00011135998,6.532188e-7],"category_scores_gemma":[0.0020146945,0.00013678627,0.000027515072,0.00038081888,0.000030631832,0.0006296823,0.0002695016,0.000240149,0.000022316563],"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.000008383645,0.000023531255,0.002294412,0.000117093325,0.000010707183,0.00013181404,0.0016016219,0.97379184,0.0011745787,0.018033624,0.00014826271,0.0026641248],"study_design_scores_gemma":[0.013896293,0.0019447679,0.4065886,0.008303695,0.00012644255,0.0008920234,0.0066581764,0.15627189,0.034169734,0.32871372,0.03330079,0.009133838],"about_ca_topic_score_codex":0.0001111592,"about_ca_topic_score_gemma":0.000047413192,"teacher_disagreement_score":0.81751996,"about_ca_system_score_codex":0.00013508214,"about_ca_system_score_gemma":0.000042787386,"threshold_uncertainty_score":0.5577982},"labels":[],"label_agreement":null},{"id":"W3012478566","doi":"10.1145/1035292.1029002","title":"Recovering binary class relationships","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; Class (philosophy); Binary number; Theoretical computer science; Software; Object-oriented programming; Programming complexity; Software development; Software construction; Artificial intelligence","score_opus":0.04904132694768226,"score_gpt":0.2737487482202274,"score_spread":0.22470742127254512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012478566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8912668,0.0002730438,0.10243457,0.003103174,0.00071595825,0.00014988631,0.000002801339,0.00091236306,0.0011413838],"genre_scores_gemma":[0.92383695,0.000007609233,0.07588512,0.000060624345,0.00008090324,0.000009194287,0.0000031958523,0.000011756411,0.00010463258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989383,0.000039184695,0.00014006262,0.00029051883,0.00029827544,0.00029361894],"domain_scores_gemma":[0.99741334,0.0015312168,0.00003758182,0.0008765983,0.000039376795,0.000101889134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665924,0.00010280965,0.00009324044,0.00015304239,0.00015143052,0.00016321478,0.0013759615,0.00006671239,0.000011022907],"category_scores_gemma":[0.0025919715,0.00010199785,0.00003216584,0.0004532888,0.000025111616,0.0006683036,0.00041522496,0.00030826015,0.00040590917],"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.00004141907,0.00032289934,0.2737312,0.00029188718,0.00015847094,0.00085033145,0.007480829,0.5619505,0.0066582,0.113413915,0.004691791,0.030408548],"study_design_scores_gemma":[0.0016775954,0.00047000774,0.91201514,0.0003235029,0.000020115434,0.00010259891,0.0001762018,0.027421162,0.007191741,0.030109292,0.019266978,0.0012256696],"about_ca_topic_score_codex":0.000050940373,"about_ca_topic_score_gemma":0.000016961667,"teacher_disagreement_score":0.63828397,"about_ca_system_score_codex":0.00008938719,"about_ca_system_score_gemma":0.00007304438,"threshold_uncertainty_score":0.5217277},"labels":[],"label_agreement":null},{"id":"W3014903559","doi":"10.1145/1449955.1449790","title":"Enabling static analysis for partial java programs","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Java; Source code; Static analysis; Partial evaluation; Class (philosophy); Type inference; Theoretical computer science; Inference; Artificial intelligence","score_opus":0.06896249739321578,"score_gpt":0.30438009191292875,"score_spread":0.23541759451971297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014903559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43865243,0.00011868256,0.560078,0.00033768703,0.0001668367,0.00025934633,0.000004115231,0.00036195864,0.000020891755],"genre_scores_gemma":[0.88016456,0.00000722582,0.11947605,0.000046047633,0.00009770052,0.00007063814,0.000017880655,0.000010843317,0.00010902791],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852943,0.000034085562,0.00020012949,0.00038253996,0.00039349825,0.00046033063],"domain_scores_gemma":[0.9969975,0.0018937973,0.000059926602,0.0008164934,0.000102653095,0.00012966286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034120632,0.00012491691,0.00020581388,0.00025901687,0.00016528333,0.00016571497,0.0013412893,0.000046065383,0.0000116423735],"category_scores_gemma":[0.0016146715,0.00011327857,0.00010860461,0.0010903091,0.00004560559,0.00035589712,0.00022146574,0.0001038143,0.00003973754],"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.000066148415,0.00044180654,0.82429653,0.00031789186,0.0017883966,0.00031484617,0.009430123,0.06461251,0.00063925394,0.0028816294,0.0022986187,0.09291222],"study_design_scores_gemma":[0.0015908395,0.0008681183,0.1406096,0.00005772374,0.00036897234,0.000035229623,0.00016816387,0.82589567,0.0070360894,0.0011081231,0.021088686,0.0011727932],"about_ca_topic_score_codex":0.00007462241,"about_ca_topic_score_gemma":0.000018631246,"teacher_disagreement_score":0.76128316,"about_ca_system_score_codex":0.000028019425,"about_ca_system_score_gemma":0.00006557773,"threshold_uncertainty_score":0.4619366},"labels":[],"label_agreement":null},{"id":"W3015598440","doi":"10.1145/3140587.3062371","title":"Low overhead dynamic binary translation on ARM","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Royal Society of Canada","keywords":"Computer science; Binary translation; Spec#; ARM architecture; Instruction set; Overhead (engineering); Parallel computing; Benchmark (surveying); Embedded system; Out-of-order execution; Operating system; Software; Programming language","score_opus":0.03242167568277721,"score_gpt":0.30312088790763136,"score_spread":0.27069921222485416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015598440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18709005,0.00024836988,0.77119005,0.007971307,0.0012196812,0.00041722154,0.000011138992,0.0016915388,0.03016062],"genre_scores_gemma":[0.90528977,0.000030133404,0.09420518,0.0002540168,0.000043174485,0.000004428527,0.000007614163,0.000008009863,0.00015765484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907154,0.00004354268,0.00015478233,0.00032567643,0.0002086727,0.00019577116],"domain_scores_gemma":[0.99815357,0.00019223144,0.0001855285,0.001377059,0.000035218167,0.000056388573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019838173,0.00012936775,0.00012639925,0.00009233695,0.00046196522,0.0004139573,0.001960025,0.00007063764,0.000010313571],"category_scores_gemma":[0.0001329383,0.00011915109,0.000046722,0.0000639749,0.000045261302,0.0005600217,0.00018051527,0.00012061131,0.00007712144],"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.00016325212,0.0011265525,0.004628162,0.00019073133,0.00011065964,0.00018685595,0.0036421565,0.10799527,0.0034074509,0.03373412,0.009270607,0.83554417],"study_design_scores_gemma":[0.00041623448,0.00036186972,0.019067949,0.00012615646,0.000007904982,0.0000044545764,0.0000071075797,0.9695354,0.003624712,0.0049143075,0.0015974195,0.0003364619],"about_ca_topic_score_codex":0.000026529784,"about_ca_topic_score_gemma":0.000014543968,"teacher_disagreement_score":0.86154014,"about_ca_system_score_codex":0.000020143336,"about_ca_system_score_gemma":0.000025793288,"threshold_uncertainty_score":0.48588404},"labels":[],"label_agreement":null},{"id":"W3015862912","doi":"10.1145/2480359.2429086","title":"Inductive data flow graphs","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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; Control flow graph; Correctness; Data flow diagram; Theoretical computer science; Thread (computing); Graph; Control flow; Data-flow analysis; Program analysis; Algorithm; Programming language; Database","score_opus":0.046605439328889164,"score_gpt":0.26774140926281986,"score_spread":0.2211359699339307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015862912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5761398,0.0025127865,0.35650808,0.015784856,0.008079054,0.0023671759,0.00091005146,0.001838871,0.03585933],"genre_scores_gemma":[0.9602218,0.00000665787,0.039013773,0.0003484785,0.00011945817,0.000021621498,0.00008352811,0.000007504321,0.00017716688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866134,0.00005458185,0.00020933623,0.0005197296,0.00026153083,0.00029348806],"domain_scores_gemma":[0.99696445,0.00016276819,0.00010997485,0.002561674,0.000091091715,0.00011001365],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018961649,0.00013969332,0.00017030668,0.000055606968,0.000113812544,0.00041525028,0.004416896,0.00006577851,0.000060289844],"category_scores_gemma":[0.00015854384,0.00011345786,0.000022483886,0.00032558193,0.00004425907,0.002135928,0.0010299855,0.0001328913,0.00084281864],"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.000014186789,0.0003716293,0.015542833,0.00014195463,0.0002846631,0.000108468994,0.0037683747,0.00043484825,0.0026472674,0.06992273,0.40524665,0.5015164],"study_design_scores_gemma":[0.0020694395,0.0003855864,0.12647663,0.00027005305,0.000060165603,0.00007180996,0.0009111066,0.54931545,0.0010861479,0.050111298,0.26714954,0.0020927843],"about_ca_topic_score_codex":0.0006003892,"about_ca_topic_score_gemma":0.000049909337,"teacher_disagreement_score":0.5488806,"about_ca_system_score_codex":0.000010024669,"about_ca_system_score_gemma":0.0000330165,"threshold_uncertainty_score":0.99993515},"labels":[],"label_agreement":null},{"id":"W3016919589","doi":"10.1145/3200691.3178489","title":"Harnessing epoch-based reclamation for efficient range queries","year":2018,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Global Affairs Canada; Israel Science Foundation","keywords":"Computer science; Garbage collection; Concurrent data structure; Range (aeronautics); Data structure; Range query (database); Overhead (engineering); Garbage; Lock (firearm); Linearizability; Transactional memory; Set (abstract data type); Implementation; Property (philosophy); Epoch (astronomy); Database; Theoretical computer science; Distributed computing; Information retrieval; Programming language; Web search query; Search engine; Sargable; Correctness","score_opus":0.03015240244174859,"score_gpt":0.2811497632410723,"score_spread":0.2509973607993237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016919589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1281696,0.0001527792,0.8672358,0.0015966294,0.0013182614,0.00032435908,0.000035730576,0.00021400531,0.0009528346],"genre_scores_gemma":[0.9496452,4.269514e-7,0.04962245,0.00028766043,0.00027007487,0.0000423468,0.00002255228,0.000008506814,0.00010076083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988826,0.000050448838,0.00024477844,0.00033358595,0.00021941421,0.00026920994],"domain_scores_gemma":[0.9986327,0.00029111907,0.00017853986,0.0006409702,0.00019598978,0.000060677143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038886262,0.0001292874,0.00016662592,0.000062626284,0.00030753488,0.00035198234,0.0007938082,0.000064080916,0.000009774035],"category_scores_gemma":[0.00030095875,0.00011110449,0.000053377084,0.00023708995,0.00008282484,0.00030931755,0.000075120144,0.00004854836,0.00006262695],"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.0010104504,0.0015124156,0.017990503,0.0029448883,0.0003092928,0.000078595906,0.027949236,0.026988914,0.03715086,0.3994363,0.07455565,0.41007292],"study_design_scores_gemma":[0.0017113794,0.00038941798,0.007887671,0.00038737446,0.000028561777,0.0000076051783,0.00018828787,0.861808,0.01606373,0.00216501,0.10871011,0.00065283943],"about_ca_topic_score_codex":0.00004139633,"about_ca_topic_score_gemma":0.000037194426,"teacher_disagreement_score":0.8348191,"about_ca_system_score_codex":0.000028137945,"about_ca_system_score_gemma":0.00006207257,"threshold_uncertainty_score":0.45307097},"labels":[],"label_agreement":null},{"id":"W3019557951","doi":"10.1145/3016078.2851160","title":"Be my guest","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Lock (firearm); Scalability; FIFO and LIFO accounting; Queue; FIFO (computing and electronics); Computer network; Context (archaeology); Partition (number theory); Distributed computing; Operating system","score_opus":0.023837888601172565,"score_gpt":0.24316960938471877,"score_spread":0.2193317207835462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019557951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8731027,0.00024101978,0.035997223,0.05365807,0.0027150125,0.00021922933,0.0000048084844,0.0010677597,0.03299416],"genre_scores_gemma":[0.98824376,0.00000350888,0.0074127982,0.0010117107,0.00040570283,0.000003542588,4.9060793e-7,0.0000073554565,0.0029111481],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894375,0.000044793902,0.00014412876,0.00034083053,0.00024706728,0.00027944005],"domain_scores_gemma":[0.9984117,0.0003984856,0.00007449388,0.0010078322,0.000026088335,0.00008135943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023047907,0.00011341473,0.0001066102,0.00006740461,0.00011604147,0.00012223699,0.0018556247,0.000034975525,0.000023457907],"category_scores_gemma":[0.00014962762,0.00006824918,0.00004439629,0.000156123,0.000042102398,0.000048830592,0.000919913,0.000050266804,0.00035521126],"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.000023032318,0.0003152022,0.0165674,0.000092750146,0.00018365613,0.0002957936,0.0036322456,0.00071391795,0.00319101,0.09211885,0.14015713,0.742709],"study_design_scores_gemma":[0.0012245417,0.00029625464,0.020533394,0.0002127784,0.000031099524,0.00002348458,0.00012036704,0.011130723,0.004089066,0.0046702833,0.9568417,0.00082630233],"about_ca_topic_score_codex":0.000032773554,"about_ca_topic_score_gemma":0.0000113156475,"teacher_disagreement_score":0.81668454,"about_ca_system_score_codex":0.000018381757,"about_ca_system_score_gemma":0.000012770057,"threshold_uncertainty_score":0.45656407},"labels":[],"label_agreement":null},{"id":"W3021368500","doi":"10.1145/2858965.2814297","title":"SATCheck: SAT-directed stateless model checking for SC and TSO","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science; Model checking; Scalability; Programming language; Stateless protocol; Parallel computing; Memory model; Thread (computing); Concurrency; Shared memory; Operating system","score_opus":0.10695654727802961,"score_gpt":0.3183851898259565,"score_spread":0.21142864254792687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021368500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37687233,0.0004715393,0.6066134,0.00096436124,0.0002693398,0.00035669882,0.000018006587,0.013939302,0.0004950204],"genre_scores_gemma":[0.5433893,0.0000032846488,0.45628443,0.00019597814,0.000039229384,0.000018869061,0.0000063873003,0.0000112724265,0.00005120786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988459,0.000035318408,0.00018901186,0.0004013396,0.00021461604,0.00031385815],"domain_scores_gemma":[0.9981991,0.0007321479,0.00011519159,0.0006331167,0.00016246199,0.00015800027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056102005,0.00016290588,0.00020251244,0.000095333184,0.000120591714,0.00024936727,0.000865521,0.000076105716,5.242788e-7],"category_scores_gemma":[0.0015545377,0.00014746535,0.000028964929,0.00017754555,0.000048826445,0.0003913017,0.00037388864,0.000099953664,0.000005137708],"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.00033088826,0.00057010644,0.14272352,0.00070855615,0.00025428194,0.00014105257,0.041339368,0.0107887015,0.0023929775,0.016272536,0.28678572,0.49769232],"study_design_scores_gemma":[0.0004991692,0.0001718322,0.0014493805,0.000084996966,0.000018202854,0.000015549567,0.00003165859,0.8874641,0.0018135055,0.107468165,0.0006284845,0.00035494156],"about_ca_topic_score_codex":0.000148434,"about_ca_topic_score_gemma":0.000026944794,"teacher_disagreement_score":0.8766754,"about_ca_system_score_codex":0.000028763123,"about_ca_system_score_gemma":0.000106889,"threshold_uncertainty_score":0.60134625},"labels":[],"label_agreement":null},{"id":"W3021705264","doi":"10.1145/3093335.2993246","title":"Delaying decisions in variable concern hierarchies","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; McGill University","funders":"","keywords":"Computer science; Reuse; Software engineering; Context (archaeology); Separation of concerns; Structuring; Interface (matter); Hierarchy; Feature (linguistics); Personalization; Core (optical fiber); Risk analysis (engineering); Software; Programming language; World Wide Web; Operating system","score_opus":0.07984859684829579,"score_gpt":0.3159243558198897,"score_spread":0.2360757589715939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021705264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03276994,0.00026865315,0.96509117,0.00057551573,0.0004566236,0.000072964096,0.000005109073,0.00038420397,0.00037581514],"genre_scores_gemma":[0.30249828,0.000054493456,0.697192,0.00008790829,0.000036519337,0.00001120273,5.383476e-7,0.000008600335,0.0001104307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878174,0.00011233103,0.00021944578,0.00034990942,0.00018242572,0.00035412353],"domain_scores_gemma":[0.98800117,0.010995101,0.00006640483,0.0008368739,0.000034669472,0.00006578181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120392,0.0001355858,0.00018839898,0.00016185358,0.000070534676,0.000063550826,0.0015865677,0.00006114875,0.000011548888],"category_scores_gemma":[0.007560868,0.00009315718,0.000025470035,0.0003653673,0.00006245215,0.0007792742,0.00060515164,0.00011618089,0.000053729545],"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.000040390525,0.00006971114,0.01845343,0.00002832788,0.00004690235,0.00018524184,0.0024436815,0.07180852,0.02039918,0.14396714,0.0007907379,0.74176675],"study_design_scores_gemma":[0.0026700133,0.00036300265,0.04365878,0.0010638201,0.000022865408,0.000071970135,0.0002656992,0.008413883,0.018198201,0.88333213,0.040077746,0.0018618591],"about_ca_topic_score_codex":0.000023352193,"about_ca_topic_score_gemma":0.00001578636,"teacher_disagreement_score":0.7399049,"about_ca_system_score_codex":0.000046745106,"about_ca_system_score_gemma":0.00004593503,"threshold_uncertainty_score":0.9051611},"labels":[],"label_agreement":null},{"id":"W3024074289","doi":"10.1145/373243.360221","title":"What packets may come","year":2001,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Protocol (science); Specification language; Construct (python library); Network packet; Point (geometry); Programming language; Theoretical computer science; Computer network","score_opus":0.060322502143974284,"score_gpt":0.33191332472271057,"score_spread":0.2715908225787363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024074289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69593406,0.0011136859,0.27115983,0.009102376,0.0070353895,0.0004251991,0.0000035967937,0.00089996407,0.01432589],"genre_scores_gemma":[0.64940864,0.00016927398,0.34901416,0.0007779903,0.00012531737,0.000009797074,0.00000453118,0.000008757797,0.0004815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988347,0.00011877048,0.00019242559,0.0003078534,0.00027175056,0.00027446536],"domain_scores_gemma":[0.99822176,0.00029534753,0.00011517861,0.001227919,0.000051908726,0.00008788468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029761,0.00011980946,0.00012587241,0.000084606225,0.000109459164,0.00048715615,0.0019049454,0.00006577739,0.00005437511],"category_scores_gemma":[0.00033598163,0.00010703447,0.00003536276,0.000338558,0.000050934923,0.0026432015,0.00032155772,0.00011782809,0.00055052695],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049594975,0.00021786238,0.029084273,0.00007667237,0.000056680386,0.00016384757,0.005079877,0.0003092515,0.0023869162,0.2961439,0.0046528005,0.66177833],"study_design_scores_gemma":[0.0018432877,0.0008453596,0.28123182,0.0003770349,0.00006792002,0.00041768193,0.0015691097,0.1295393,0.03450359,0.0760812,0.47119653,0.0023271586],"about_ca_topic_score_codex":0.000014336181,"about_ca_topic_score_gemma":0.0000112748985,"teacher_disagreement_score":0.6594512,"about_ca_system_score_codex":0.00002530518,"about_ca_system_score_gemma":0.00001977068,"threshold_uncertainty_score":0.70760936},"labels":[],"label_agreement":null},{"id":"W3029402327","doi":"10.1145/2578855.2535857","title":"Symbolic optimization with SMT solvers","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"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; Satisfiability modulo theories; Symbolic execution; Programming language; Satisfiability; Set (abstract data type); Function (biology); Software; Theoretical computer science; Algorithm","score_opus":0.012830927648873825,"score_gpt":0.2239901630927133,"score_spread":0.21115923544383947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029402327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01001013,0.000022798538,0.9793479,0.00064865506,0.000119570024,0.000078298195,5.782185e-7,0.006908721,0.0028633515],"genre_scores_gemma":[0.5304784,0.0000014587529,0.46908402,0.00034819363,0.00004241918,0.0000055482806,0.0000028412908,0.0000069737116,0.000030118666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991769,0.00004493695,0.00010619077,0.00027527107,0.00019529914,0.00020135712],"domain_scores_gemma":[0.9984659,0.00054611475,0.00008769751,0.0007764141,0.000059029826,0.00006484133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022513374,0.00011360774,0.00011501825,0.00008365572,0.0001156402,0.00017279814,0.0009850543,0.0000444966,0.000006767318],"category_scores_gemma":[0.0005252382,0.00008922053,0.000018654955,0.0002319461,0.000038215938,0.000321724,0.00016042124,0.000078484445,0.000025673222],"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.00009423465,0.00043952203,0.21524064,0.00028396244,0.00018175883,0.00010470438,0.008341495,0.317078,0.00025488102,0.06256419,0.09541269,0.30000392],"study_design_scores_gemma":[0.00048940943,0.00052426057,0.0056700003,0.00015753861,0.000028644097,0.000040516836,0.000012364257,0.972555,0.001149508,0.015683664,0.0031077953,0.000581346],"about_ca_topic_score_codex":0.0000831682,"about_ca_topic_score_gemma":0.000007359663,"teacher_disagreement_score":0.6554769,"about_ca_system_score_codex":0.000012375846,"about_ca_system_score_gemma":0.00002476,"threshold_uncertainty_score":0.36383078},"labels":[],"label_agreement":null},{"id":"W3033938031","doi":"10.1145/2076021.2048077","title":"Kind analysis for MATLAB","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Compiler; Scripting language; MATLAB; Identifier; Syntax; Variety (cybernetics); Artificial intelligence","score_opus":0.06272742362140878,"score_gpt":0.28008440688772573,"score_spread":0.21735698326631697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033938031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007817168,0.000053139305,0.98702615,0.00018031464,0.00010295867,0.000109487366,0.0000035749838,0.00043652358,0.0042706938],"genre_scores_gemma":[0.5181404,0.0000030545807,0.48151037,0.0001613532,0.000021867396,0.000009031484,0.0000055775336,0.0000034942443,0.00014487619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992315,0.000030650863,0.0001634893,0.00027556365,0.00011018371,0.00018859585],"domain_scores_gemma":[0.9988842,0.00018960386,0.00011006495,0.0006860869,0.00007547968,0.000054569045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002225279,0.0000948081,0.00015335881,0.00019885799,0.000103277074,0.00009847101,0.0013307241,0.000048691323,0.000025125997],"category_scores_gemma":[0.000111226684,0.00008397495,0.00009074275,0.00051615445,0.000019971034,0.00023657025,0.00019580862,0.000044265435,0.00002242443],"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.00022916049,0.0013179551,0.21600622,0.00029923287,0.0043295873,0.00010006598,0.032378055,0.049331356,0.0007421064,0.48354396,0.05492352,0.15679878],"study_design_scores_gemma":[0.0006470492,0.0004038268,0.051739454,0.000027461652,0.00042165458,0.0000058720966,0.00007299607,0.8853277,0.016545432,0.03225353,0.011650393,0.00090464647],"about_ca_topic_score_codex":0.00006214211,"about_ca_topic_score_gemma":0.000015532747,"teacher_disagreement_score":0.8359963,"about_ca_system_score_codex":0.000008130472,"about_ca_system_score_gemma":0.000016552736,"threshold_uncertainty_score":0.3424399},"labels":[],"label_agreement":null},{"id":"W3046561353","doi":"10.1145/3299706.3210568","title":"OMR: out-of-core MapReduce for large data sets","year":2018,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Parallel computing; Programmer; Auxiliary memory; Block (permutation group theory); Operating system","score_opus":0.09358850451153312,"score_gpt":0.33156161810470003,"score_spread":0.23797311359316692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046561353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77978843,0.00052328914,0.19944504,0.0051955353,0.0055467295,0.0008837032,0.00024914645,0.0006128572,0.007755276],"genre_scores_gemma":[0.93317616,0.0000011847636,0.065373026,0.00039862533,0.0004626804,0.0000046906184,0.00003285632,0.000011237887,0.0005395606],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986334,0.00003003202,0.00022936799,0.0005225949,0.00023766226,0.00034698512],"domain_scores_gemma":[0.9968283,0.00037685334,0.00016322504,0.0024857975,0.000078935045,0.00006688147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058466854,0.00013211674,0.00017263132,0.0000710299,0.00017524553,0.000101417056,0.004503782,0.00004793366,0.000011882113],"category_scores_gemma":[0.00028857778,0.00011085255,0.000043491244,0.00016151671,0.000051378538,0.00006718229,0.0028786205,0.00006624532,0.00007844316],"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.00014231277,0.0010691951,0.008977244,0.0009044772,0.0006020805,0.000053959793,0.020842288,0.000772859,0.0015666421,0.06963549,0.44946274,0.4459707],"study_design_scores_gemma":[0.0010150708,0.00047789593,0.0035197726,0.00013913518,0.00006873734,0.000003868682,0.00030552747,0.62426513,0.0016266023,0.0043737,0.36372328,0.0004812955],"about_ca_topic_score_codex":0.000024686598,"about_ca_topic_score_gemma":0.000052427557,"teacher_disagreement_score":0.62349224,"about_ca_system_score_codex":0.000009033427,"about_ca_system_score_gemma":0.000027518607,"threshold_uncertainty_score":0.8369222},"labels":[],"label_agreement":null},{"id":"W3081377611","doi":"10.1145/2578854.2503785","title":"Adding structure to monoids","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","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":"Magna International (Canada)","funders":"","keywords":"Haskell; Computer science; Monoid; Parsing; Programming language; Generic programming; Interface (matter); Functional programming; Theoretical computer science; Discrete mathematics; Mathematics; Operating system","score_opus":0.02033894455871284,"score_gpt":0.24568231029070353,"score_spread":0.22534336573199068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081377611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74625844,0.00073158497,0.20893688,0.005679264,0.005248896,0.0018790911,0.000009474066,0.0015370245,0.029719364],"genre_scores_gemma":[0.9727351,8.4454234e-7,0.025971027,0.000553871,0.00023468719,0.00001959211,0.000003583073,0.000008233492,0.00047306463],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989173,0.00004010022,0.00016394872,0.00033721366,0.00021442489,0.0003270066],"domain_scores_gemma":[0.99881417,0.00012809309,0.00007248958,0.000766823,0.00006407305,0.00015435943],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000104913495,0.00013540512,0.00014723695,0.00007788752,0.00011655872,0.00049026706,0.001539011,0.00007139642,0.0001150806],"category_scores_gemma":[0.000138735,0.000102647944,0.000034720157,0.00024624087,0.000016602937,0.0005297327,0.00038789102,0.00009982026,0.00095073046],"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.000009103758,0.00008713359,0.03262947,0.0001460983,0.000118725,0.00006359198,0.012442963,0.00057038,0.012037772,0.43550926,0.05068806,0.45569745],"study_design_scores_gemma":[0.0017042143,0.0015152188,0.11172124,0.000067892666,0.0000712974,0.00012374717,0.0017789287,0.026125029,0.022222117,0.22617704,0.6051314,0.0033618845],"about_ca_topic_score_codex":0.0004365017,"about_ca_topic_score_gemma":0.00007009216,"teacher_disagreement_score":0.55444336,"about_ca_system_score_codex":0.000018155859,"about_ca_system_score_gemma":0.000019818168,"threshold_uncertainty_score":0.99982715},"labels":[],"label_agreement":null},{"id":"W3084019840","doi":"10.1145/1167515.1167500","title":"Generic ownership for generic Java","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Marsden Fund; Engineering and Physical Sciences Research Council; Royal Society Te Apārangi; Royal Society","keywords":"Computer science; Java; Programming language; Reuse; Mainstream; Object-oriented programming; Generics in Java; Scala; Functional programming; Real time Java; Java concurrency","score_opus":0.0506714026636345,"score_gpt":0.2561094287464739,"score_spread":0.2054380260828394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084019840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063040935,0.0033608554,0.91043603,0.0024831411,0.0036394242,0.0010642688,0.000008406794,0.0010184571,0.0149485],"genre_scores_gemma":[0.9631741,0.0000052999585,0.034026384,0.0002978882,0.0007907757,0.000046059722,0.000023188357,0.000015529393,0.0016207957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985679,0.000055062683,0.0002566447,0.00043926007,0.00023260903,0.0004485249],"domain_scores_gemma":[0.9986448,0.00024598188,0.00016898318,0.00078979606,0.00007185577,0.000078571524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030343136,0.00017842185,0.00020163709,0.00008515374,0.00019163465,0.00029672912,0.0014547916,0.000091771166,0.000010875507],"category_scores_gemma":[0.00008400344,0.0001363524,0.00009405391,0.00029267202,0.000040418927,0.00029713116,0.00018187489,0.000066033484,0.0001495228],"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.000034889752,0.0003419662,0.025952008,0.00035461408,0.00011529864,0.00009881068,0.0013656996,0.0014767972,0.0048700683,0.75857586,0.063414894,0.1433991],"study_design_scores_gemma":[0.0017115873,0.00073443813,0.014079261,0.000015425505,0.00009068276,0.000072037335,0.00016572766,0.035352957,0.009001439,0.14680031,0.7904701,0.0015060026],"about_ca_topic_score_codex":0.0003581573,"about_ca_topic_score_gemma":0.00015304935,"teacher_disagreement_score":0.90013313,"about_ca_system_score_codex":0.00002732334,"about_ca_system_score_gemma":0.00004502632,"threshold_uncertainty_score":0.55602896},"labels":[],"label_agreement":null},{"id":"W3085652395","doi":"10.1145/3393673.3276968","title":"Numerical computing on the web: benchmarking for the future","year":2020,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Benchmarking; Computer science; JavaScript; Benchmark (surveying); Suite; Web application; Workstation; Mobile device; Operating system; Unobtrusive JavaScript; World Wide Web; Rich Internet application","score_opus":0.02884036809374038,"score_gpt":0.24609336291929546,"score_spread":0.21725299482555507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085652395","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1404541,0.0007860447,0.21455434,0.6364378,0.002631325,0.0010182357,0.0000041445874,0.00062706025,0.0034869742],"genre_scores_gemma":[0.97653925,0.0000029758285,0.0064137476,0.014961917,0.002037038,0.0000072873117,9.947076e-7,0.000009679324,0.000027083617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879426,0.000087146946,0.00017115135,0.00036268975,0.00029195735,0.00029278867],"domain_scores_gemma":[0.99626285,0.0028563545,0.000120506025,0.0006679728,0.000027293256,0.00006504199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042568325,0.00014682086,0.0001276237,0.000019841878,0.00066074735,0.0003287012,0.0026424248,0.000034865487,0.000008922059],"category_scores_gemma":[0.00019303431,0.00007377388,0.00009810352,0.00029996852,0.000034663328,0.00001693999,0.00066966214,0.00022857182,0.0000364192],"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.00004930981,0.000082184015,0.0011146831,0.00008778261,0.0002004152,0.00002581939,0.009459122,0.21066907,0.000052626416,0.08497642,0.105054036,0.5882285],"study_design_scores_gemma":[0.0001415803,0.0001279379,0.0009331899,0.00002124732,0.000012680609,0.0000015014723,0.00035480628,0.86040175,0.000032434134,0.00019620676,0.13766064,0.000116022406],"about_ca_topic_score_codex":0.000008363904,"about_ca_topic_score_gemma":0.0000020775535,"teacher_disagreement_score":0.8360852,"about_ca_system_score_codex":0.000012001833,"about_ca_system_score_gemma":0.000016773949,"threshold_uncertainty_score":0.5082001},"labels":[],"label_agreement":null},{"id":"W3093060337","doi":"10.1145/640128.604132","title":"The essence of XML","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"XPath; Computer science; XML Schema Editor; Document Structure Description; XQuery; XML validation; XML Schema (W3C); Programming language; Streaming XML; Efficient XML Interchange; Information retrieval; RELAX NG; XML; Document type definition; World Wide Web","score_opus":0.015706351964519357,"score_gpt":0.2509543156734476,"score_spread":0.23524796370892825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093060337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030444458,0.0015267445,0.953372,0.0009419614,0.0011329696,0.00019403257,0.00001726661,0.00011404702,0.012256537],"genre_scores_gemma":[0.9366827,0.00002811848,0.06289165,0.00006963813,0.000025699255,0.000005978368,0.0000010713603,0.000003865269,0.00029127175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992909,0.00006116399,0.000161864,0.00015838923,0.00016663414,0.00016106818],"domain_scores_gemma":[0.99825865,0.0006146883,0.00011952695,0.00092532416,0.000047651793,0.000034154582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027522887,0.000069760805,0.000092563074,0.00001762483,0.00018330039,0.00003476591,0.0007382136,0.000018314173,0.000005562885],"category_scores_gemma":[0.0005899409,0.000042838587,0.000023273562,0.00015985945,0.0000785769,0.0003932779,0.0001427816,0.00005136234,0.000026192833],"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.0000016139361,0.00000763508,0.00073114916,0.000012287089,0.000005570634,0.000003952462,0.0001878074,0.000047673348,0.0008402886,0.9951012,0.00040165428,0.0026591707],"study_design_scores_gemma":[0.00036395653,0.00014938989,0.0041410853,0.00009901482,0.000011120183,0.000037364185,0.00091077184,0.0015093252,0.046990845,0.03474794,0.91063315,0.0004060628],"about_ca_topic_score_codex":0.000036190613,"about_ca_topic_score_gemma":0.000051216815,"teacher_disagreement_score":0.96035326,"about_ca_system_score_codex":0.000004553631,"about_ca_system_score_gemma":0.000034326895,"threshold_uncertainty_score":0.1746907},"labels":[],"label_agreement":null},{"id":"W3119704926","doi":"10.1145/1508284.1508283","title":"Architectural support for SWAR text processing with parallel bit streams","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; SIMD; Operand; Parallel computing; Instruction set; Set (abstract data type); Addressing mode; Parsing; Regular expression; Computer architecture; Programming language; Instructions per cycle; Computer hardware","score_opus":0.018162188717529976,"score_gpt":0.2646916969588718,"score_spread":0.24652950824134182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119704926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087656766,0.00024083776,0.9074626,0.00231654,0.00016195752,0.0004837202,0.00003415641,0.0003735916,0.0012698228],"genre_scores_gemma":[0.62109894,0.0000022833824,0.37808135,0.0004633204,0.00012469378,0.000011761658,0.000045241875,0.000007755677,0.00016466284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987146,0.000018198567,0.00018147015,0.00044297875,0.00026960904,0.00037312802],"domain_scores_gemma":[0.9988756,0.00014485302,0.00013493029,0.0006682501,0.000061774044,0.00011455951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011983667,0.00018552788,0.00018342205,0.00007306572,0.00022146867,0.0003159854,0.0013433906,0.00004851934,0.000010753947],"category_scores_gemma":[0.000038808455,0.00012336938,0.00003814597,0.0001760979,0.00003703959,0.00076772145,0.00016360219,0.00010954329,0.000018478178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008941359,0.000095292315,0.00059986085,0.00003606324,0.000013256432,0.00003375088,0.0008017978,0.0014508837,0.00028821384,0.0013071732,0.0015149687,0.99376935],"study_design_scores_gemma":[0.0053509874,0.006486821,0.04867863,0.00061061117,0.00012491304,0.00038429952,0.00036943922,0.8463272,0.0057703434,0.02227182,0.061178867,0.0024461101],"about_ca_topic_score_codex":0.00002615033,"about_ca_topic_score_gemma":0.00001795469,"teacher_disagreement_score":0.99132323,"about_ca_system_score_codex":0.000011852784,"about_ca_system_score_gemma":0.00007926704,"threshold_uncertainty_score":0.50308573},"labels":[],"label_agreement":null},{"id":"W3120062901","doi":"10.1145/1328897.1328483","title":"A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Syntax; Metaprogramming; Abstract syntax; Recursion (computer science); Substitution (logic); Class (philosophy); Functional programming; Theoretical computer science; Semantics (computer science); Artificial intelligence","score_opus":0.03549497197042957,"score_gpt":0.25811222237497794,"score_spread":0.22261725040454838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120062901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36276424,0.0013620182,0.61703354,0.004547994,0.002447749,0.0032741402,0.00000661693,0.0012459686,0.0073177298],"genre_scores_gemma":[0.9634989,0.000017990757,0.03594835,0.00005817904,0.0001198825,0.00007355229,0.000017177226,0.000011316158,0.00025463192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989559,0.000020992602,0.00018038982,0.00035761922,0.00019047722,0.00029461793],"domain_scores_gemma":[0.99886304,0.00032969133,0.00013886666,0.00043086565,0.00015137705,0.000086181164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019099636,0.0001545526,0.00016211042,0.00006727552,0.00047121893,0.00023584037,0.00045641063,0.00007126324,0.000013150747],"category_scores_gemma":[0.0001366194,0.00011555852,0.000027305143,0.00027558644,0.00019595351,0.00046514612,0.000076073884,0.00008271961,0.000040455925],"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.000091034366,0.00022795562,0.018361436,0.0003957588,0.00013125241,0.00008852547,0.0030382953,0.00023013237,0.0000720004,0.93517935,0.00046221307,0.04172202],"study_design_scores_gemma":[0.0038298934,0.0028759649,0.06937673,0.00014527408,0.00025105843,0.0006272877,0.00048300694,0.010470667,0.00073193514,0.031853978,0.87736297,0.0019912503],"about_ca_topic_score_codex":0.00015971113,"about_ca_topic_score_gemma":0.00024997673,"teacher_disagreement_score":0.9033254,"about_ca_system_score_codex":0.000027878561,"about_ca_system_score_gemma":0.00008555542,"threshold_uncertainty_score":0.47123396},"labels":[],"label_agreement":null},{"id":"W3128138886","doi":"10.1145/1932682.1869521","title":"Registration-based language abstractions","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","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":"University of British Columbia","funders":"","keywords":"Computer science; Programmer; Construct (python library); Programming language; Language construct; Very high-level programming language; Key (lock); High-level programming language; Programming paradigm; Functional logic programming; Inductive programming","score_opus":0.03011480301778718,"score_gpt":0.3123308121305048,"score_spread":0.2822160091127176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128138886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07537221,0.00003044393,0.9207001,0.0009991965,0.00081451674,0.0000625703,0.0000040332447,0.0007723596,0.0012445968],"genre_scores_gemma":[0.4766039,4.531629e-7,0.5231396,0.000086396285,0.000059239745,0.0000063169787,0.0000036611982,0.0000048479656,0.00009558179],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929494,0.000027654403,0.00012766599,0.00022727331,0.00014775911,0.00017472122],"domain_scores_gemma":[0.9969261,0.0019445545,0.000079003374,0.0009588472,0.00003519443,0.000056254674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026250057,0.00009842064,0.00008902016,0.00006853344,0.000090456444,0.0001024392,0.0009816824,0.000065744425,0.00003095429],"category_scores_gemma":[0.0025360673,0.0000919449,0.000031317846,0.00013495269,0.000041400857,0.0004042816,0.000073605835,0.0002681864,0.000085127],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002566344,0.00027137104,0.005082804,0.0001614017,0.00007484492,0.00032352662,0.0031733536,0.3325892,0.35639405,0.11725196,0.0037586458,0.18089315],"study_design_scores_gemma":[0.0028241577,0.00065553846,0.20758751,0.00014016185,0.00011467842,0.00019778473,0.0014209853,0.10598729,0.5102261,0.08256647,0.08387625,0.0044031097],"about_ca_topic_score_codex":0.00003835761,"about_ca_topic_score_gemma":0.00011168468,"teacher_disagreement_score":0.40123168,"about_ca_system_score_codex":0.00000885118,"about_ca_system_score_gemma":0.000045968405,"threshold_uncertainty_score":0.37494043},"labels":[],"label_agreement":null},{"id":"W3137917418","doi":"10.1145/1735971.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Shared memory; Multi-core processor; Gang scheduling; Cache; Parallel computing; Fair-share scheduling; Quality of service; Two-level scheduling; Operating system; Computer network","score_opus":0.057632346588271835,"score_gpt":0.3106199538624083,"score_spread":0.2529876072741365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137917418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50462854,0.000108739456,0.49184394,0.0008331998,0.0002675928,0.00024007607,0.0000017322416,0.00081489776,0.001261295],"genre_scores_gemma":[0.69607973,0.0000014983107,0.30365974,0.00014759629,0.000047276924,0.000008600587,0.000008801224,0.000007948876,0.00003877637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987949,0.000059582024,0.0002787905,0.00038524173,0.00021252673,0.00026895368],"domain_scores_gemma":[0.99886584,0.00023281298,0.0001831355,0.00055700255,0.00009076084,0.00007043697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042673002,0.00013825852,0.00015834294,0.0001941663,0.0001503815,0.00030783712,0.0012436567,0.000113973736,0.000010254749],"category_scores_gemma":[0.00067979534,0.00013233648,0.00003462631,0.0003571717,0.00004179953,0.00059485884,0.00029081717,0.00034273116,0.000016643102],"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.00022958938,0.0012827003,0.1944523,0.00077778747,0.00011182623,0.00030839516,0.026093014,0.21176526,0.11909855,0.013448854,0.0025189114,0.4299128],"study_design_scores_gemma":[0.00043914717,0.00003611333,0.009221734,0.00016804835,0.000004707197,0.000009729604,0.00006368412,0.9819892,0.006106503,0.0011078761,0.00058348506,0.0002697948],"about_ca_topic_score_codex":0.00006651406,"about_ca_topic_score_gemma":0.00008889824,"teacher_disagreement_score":0.7702239,"about_ca_system_score_codex":0.0000146571965,"about_ca_system_score_gemma":0.000032294916,"threshold_uncertainty_score":0.5396525},"labels":[],"label_agreement":null},{"id":"W3140162682","doi":"10.1145/543552.512542","title":"Profile-guided code compression","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Executable; Memory footprint; Code (set theory); Overhead (engineering); Compression (physics); Software; Dead code; Embedded system; Set (abstract data type); Operating system; Programming language; Code generation; Redundant code; Key (lock)","score_opus":0.06253402740222241,"score_gpt":0.29262444176266994,"score_spread":0.23009041436044753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140162682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019713802,0.0006706445,0.9187426,0.0041036983,0.0006211237,0.00037758984,0.000008248131,0.0030361342,0.052726164],"genre_scores_gemma":[0.6358424,0.00003124193,0.36230662,0.00055454526,0.00007161298,0.000009312425,0.0000058122205,0.0000089713785,0.0011695154],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988816,0.00008091073,0.00021900581,0.00033515514,0.00024130174,0.00024204071],"domain_scores_gemma":[0.99867254,0.0002032575,0.00012826579,0.0008446306,0.00006868579,0.000082618775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015980893,0.00013288685,0.00014547016,0.00009305692,0.00017764389,0.00018049816,0.0016309752,0.00006754191,0.000110815665],"category_scores_gemma":[0.00015693784,0.00011425882,0.00003856897,0.0002450391,0.000032534546,0.0003578027,0.00042559762,0.000118973345,0.0002663269],"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.000014132977,0.0005334471,0.0076158256,0.000120993056,0.00006688861,0.000110525936,0.004052069,0.02475081,0.0025903375,0.029141698,0.8158642,0.11513904],"study_design_scores_gemma":[0.0002766239,0.000073533876,0.0009529956,0.000056271867,0.000005393171,0.000015857706,0.000007708836,0.97067046,0.006817631,0.0012011023,0.019644711,0.00027773296],"about_ca_topic_score_codex":0.000015739952,"about_ca_topic_score_gemma":0.0000019363727,"teacher_disagreement_score":0.94591963,"about_ca_system_score_codex":0.000014658284,"about_ca_system_score_gemma":0.000008721385,"threshold_uncertainty_score":0.46593398},"labels":[],"label_agreement":null},{"id":"W3148573243","doi":"10.1145/2858788.2688521","title":"On optimizing machine learning workloads via kernel fusion","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"Nvidia","keywords":"Computer science; Kernel (algebra); Scalability; Locality; Parallel computing; Matrix multiplication; Computation; Range (aeronautics); Algorithm","score_opus":0.03233663507408029,"score_gpt":0.2699771110886107,"score_spread":0.23764047601453042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148573243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017806375,0.00034909527,0.9710273,0.0008483063,0.0003717444,0.00011349945,6.665e-7,0.001297684,0.008185295],"genre_scores_gemma":[0.6843567,0.000018364117,0.3147604,0.00040652018,0.0000706536,0.0000040288323,0.000008819362,0.000012467801,0.00036205866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986045,0.00014465023,0.00021881907,0.00039425062,0.00035085884,0.00028695253],"domain_scores_gemma":[0.99861056,0.00034459907,0.00016317319,0.0006311318,0.00009000061,0.00016054374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053631107,0.00017908915,0.00017802075,0.00015629992,0.00019697123,0.00023245094,0.0013118223,0.00008463556,0.000012484516],"category_scores_gemma":[0.0004703137,0.00015841077,0.00004484956,0.00032817153,0.000025898935,0.000334295,0.0005632535,0.00028673623,0.0001346564],"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.00007133963,0.00016304762,0.003961464,0.000020274983,0.000030972802,0.0000682125,0.002869463,0.90745103,0.0002930863,0.006462612,0.0065526273,0.07205588],"study_design_scores_gemma":[0.00036991131,0.00029439648,0.00020736891,0.00006974993,0.000005999413,0.000011162575,0.000023754532,0.99135286,0.00128385,0.0035141783,0.0025841256,0.00028263286],"about_ca_topic_score_codex":0.0000753057,"about_ca_topic_score_gemma":0.0000049738433,"teacher_disagreement_score":0.66655034,"about_ca_system_score_codex":0.000041306204,"about_ca_system_score_gemma":0.000035773905,"threshold_uncertainty_score":0.64598036},"labels":[],"label_agreement":null},{"id":"W3157431840","doi":"10.1145/2544174.2500591","title":"Wellfounded recursion with copatterns","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Normalization (sociology); Rewriting; Recursion (computer science); Programming language; Theoretical computer science; Functional programming; Data type; Algorithm","score_opus":0.023532693790134885,"score_gpt":0.23823452870734746,"score_spread":0.21470183491721256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157431840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5627036,0.0006009797,0.36703023,0.007094877,0.0028792655,0.0017214463,0.0000023086689,0.0014532472,0.05651404],"genre_scores_gemma":[0.9911054,0.000004067303,0.007312872,0.0003527627,0.000126663,0.000027504433,0.0000047727535,0.000009258487,0.0010566948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888206,0.000058722224,0.000153264,0.00033683906,0.00026780978,0.00030132546],"domain_scores_gemma":[0.99875355,0.0001441857,0.00012064451,0.0008012577,0.00007681164,0.00010354501],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015004867,0.00013976589,0.00014897896,0.000055591576,0.00011962947,0.0004172003,0.0012147492,0.00005825741,0.00011216858],"category_scores_gemma":[0.000040213185,0.000092904316,0.000028739345,0.00017797401,0.000042908036,0.00063818414,0.00020302329,0.00010016995,0.0014794013],"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.0000648653,0.000635407,0.25959384,0.0004689766,0.0002537047,0.00032428585,0.012104491,0.00015337291,0.0021885007,0.3492715,0.048547387,0.32639366],"study_design_scores_gemma":[0.005738706,0.005498723,0.21247566,0.00020874328,0.00013619516,0.00047586986,0.0022280882,0.023928847,0.013675145,0.16663861,0.56474304,0.0042523914],"about_ca_topic_score_codex":0.0008305237,"about_ca_topic_score_gemma":0.00013319502,"teacher_disagreement_score":0.51619565,"about_ca_system_score_codex":0.00001888568,"about_ca_system_score_gemma":0.00002710177,"threshold_uncertainty_score":0.99929804},"labels":[],"label_agreement":null},{"id":"W3161455369","doi":"10.1145/949343.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Just-in-time compilation; Java; Suite; Programming language; Benchmark (surveying); Set (abstract data type); Metric (unit)","score_opus":0.026085039855794065,"score_gpt":0.28849246355163466,"score_spread":0.2624074236958406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161455369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021959068,0.00028535063,0.992269,0.0003573817,0.00028642308,0.00015951539,0.0000026990474,0.0004563574,0.003987402],"genre_scores_gemma":[0.38349393,0.000014498113,0.61591035,0.00024996194,0.000009728303,0.0000098024875,0.0000037759276,0.000006203598,0.00030174968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991465,0.000050190974,0.00016398054,0.00027382854,0.00014217867,0.00022331753],"domain_scores_gemma":[0.9985982,0.0005663252,0.00009696961,0.0005951803,0.000086335975,0.00005696218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036710507,0.00010408074,0.000121876525,0.00015520843,0.00013305321,0.00014963582,0.001035561,0.000056358644,0.000006066539],"category_scores_gemma":[0.0009661418,0.00009617789,0.00004800429,0.000430472,0.000017418444,0.00022554422,0.00010283917,0.00006199099,0.000021530113],"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.000029411487,0.00048162317,0.005539598,0.00023015242,0.00016537274,0.000031639713,0.0021327466,0.05244216,0.0007508338,0.7469526,0.055748083,0.13549578],"study_design_scores_gemma":[0.0005434999,0.0002332029,0.0005559557,0.0000238632,0.000018948385,0.000012945277,0.00002867125,0.8841853,0.0049221897,0.033993118,0.074990526,0.000491769],"about_ca_topic_score_codex":0.0000054540346,"about_ca_topic_score_gemma":0.0000034571303,"teacher_disagreement_score":0.8317431,"about_ca_system_score_codex":0.000021429425,"about_ca_system_score_gemma":0.000038567425,"threshold_uncertainty_score":0.39220205},"labels":[],"label_agreement":null},{"id":"W3163160051","doi":"10.1145/2637365.2517225","title":"On the simplicity of synthesizing linked data structure operations","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Simplicity; Data structure; Code (set theory); Simple (philosophy); Code generation; Programming language; Algorithm; Theoretical computer science; Parallel computing; Set (abstract data type); Operating system","score_opus":0.06814676140076811,"score_gpt":0.28931906523018935,"score_spread":0.22117230382942124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163160051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90690356,0.000075084055,0.079360396,0.00872606,0.0002275077,0.000490249,0.00006496181,0.0035692486,0.00058291975],"genre_scores_gemma":[0.8724882,0.0000012210594,0.12675224,0.0006904916,0.000037120473,0.0000069945077,0.000008982223,0.000005424104,0.000009313429],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916,0.00007593475,0.00016099324,0.00027160568,0.00018698564,0.00014446834],"domain_scores_gemma":[0.99399227,0.0033097162,0.00007621385,0.0025114908,0.0000753816,0.00003494087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023652565,0.00009878368,0.00011224608,0.000044261447,0.00016970144,0.00020217281,0.0034950026,0.00004762765,0.0000389572],"category_scores_gemma":[0.003989763,0.000060483508,0.000017094113,0.00017032005,0.00004975337,0.00040255042,0.00078326126,0.0001396863,0.000023699495],"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.000019537321,0.00045439185,0.029142788,0.00022866424,0.00027070392,0.000021789938,0.007290622,0.0068902546,0.029543033,0.25946575,0.40695208,0.25972039],"study_design_scores_gemma":[0.00019272539,0.00025925066,0.04366876,0.00031741484,0.00004026354,0.000018153618,0.000058981663,0.61472315,0.015941622,0.32350022,0.0006787084,0.0006007834],"about_ca_topic_score_codex":0.0006281657,"about_ca_topic_score_gemma":0.000038569593,"teacher_disagreement_score":0.60783285,"about_ca_system_score_codex":0.0000069566963,"about_ca_system_score_gemma":0.000030337895,"threshold_uncertainty_score":0.64946425},"labels":[],"label_agreement":null},{"id":"W3165577427","doi":"10.1145/583852.581487","title":"A demand-driven adaptive type analysis","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Compiler; Abstract interpretation; Programming language; Program transformation; Static analysis; Compile time; Program analysis; Combinatory logic; Type (biology); Partial evaluation; Simple (philosophy); Functional programming; Scheme (mathematics); Haskell","score_opus":0.04918490563868369,"score_gpt":0.2558476397149979,"score_spread":0.20666273407631422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165577427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10875126,0.004702722,0.7921626,0.0024182838,0.0027866722,0.0009486391,0.000008963485,0.0016534006,0.08656748],"genre_scores_gemma":[0.9905176,0.000017944021,0.008242668,0.00015735999,0.00011725846,0.0000067596798,0.0000038673893,0.0000061284095,0.00093039183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988022,0.00008996832,0.00018861433,0.00037487518,0.0002573588,0.00028699412],"domain_scores_gemma":[0.9986872,0.00019547791,0.00013238903,0.0007999462,0.00008369367,0.00010125686],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016918324,0.0001379829,0.00024137352,0.00016847093,0.00012375577,0.00019366751,0.0012432736,0.0000720065,0.0001346119],"category_scores_gemma":[0.00010437101,0.00010875915,0.00010401009,0.0010438382,0.000037894115,0.00032592643,0.00023621821,0.00009490936,0.0007839357],"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.000059904592,0.0008231227,0.21113895,0.00012668477,0.004897109,0.00069600734,0.028639546,0.00806336,0.00040508708,0.5847598,0.023300054,0.13709038],"study_design_scores_gemma":[0.0012019512,0.0017207161,0.033415746,0.000015891856,0.0011614909,0.000043294505,0.00054468506,0.86799634,0.00060674886,0.016595501,0.075120434,0.0015771835],"about_ca_topic_score_codex":0.0001634903,"about_ca_topic_score_gemma":0.00018931719,"teacher_disagreement_score":0.8817664,"about_ca_system_score_codex":0.000018921186,"about_ca_system_score_gemma":0.000010873341,"threshold_uncertainty_score":0.9999941},"labels":[],"label_agreement":null},{"id":"W3167435556","doi":"10.1145/966049.781532","title":"Using generative design patterns to generate parallel code for a distributed memory environment","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Software design pattern; Programmer; Programming language; Design pattern; Code generation; Distributed memory; Code (set theory); Synchronization (alternating current); Set (abstract data type); Object-oriented programming; Java; Parallel computing; Distributed computing; Shared memory; Software; Operating system; Key (lock)","score_opus":0.0906055666464555,"score_gpt":0.3005933843122476,"score_spread":0.20998781766579208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167435556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01090823,0.00008832898,0.98760283,0.00034746114,0.00014670136,0.00057632267,0.00006640779,0.00021756848,0.000046177753],"genre_scores_gemma":[0.1914732,0.000011863268,0.80772,0.000579991,0.00005025726,0.00006496174,0.000024244588,0.000014244723,0.00006122567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984211,0.00023054406,0.00027258607,0.0005108681,0.0001951419,0.0003697674],"domain_scores_gemma":[0.99870354,0.00029264754,0.00014295599,0.00066053245,0.000057535042,0.00014281087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043708636,0.00021341717,0.00021407178,0.00008629189,0.00026545144,0.00019722006,0.0008622361,0.00006955382,0.000012505918],"category_scores_gemma":[0.00018767503,0.00020103605,0.00005540586,0.00014967112,0.000021083728,0.00020916328,0.00018205849,0.000073212446,0.0000152135935],"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.000013262272,0.000054058037,0.00021298381,0.000009748809,0.000028694809,0.00000754118,0.00049306534,0.99292004,0.0014568089,0.002065781,0.0016848118,0.0010532193],"study_design_scores_gemma":[0.00049114827,0.00021572,0.00014978806,0.00002586281,0.000022035287,0.000008671852,0.000037518264,0.9423512,0.051588956,0.0017977384,0.0028576592,0.00045368535],"about_ca_topic_score_codex":0.00001426572,"about_ca_topic_score_gemma":0.0000047800977,"teacher_disagreement_score":0.18056497,"about_ca_system_score_codex":0.00007397751,"about_ca_system_score_gemma":0.00005700493,"threshold_uncertainty_score":0.8198012},"labels":[],"label_agreement":null},{"id":"W3180751300","doi":"10.1145/1543136.1542471","title":"Tracing interrupts in embedded software","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Debugging; Computer science; Tracing; Interrupt; Control flow; Software; Algorithmic program debugging; Embedded software; Background debug mode interface; Embedded system; Heuristic; Programming language; Distributed computing; Operating system","score_opus":0.02052073300440651,"score_gpt":0.2749397261982433,"score_spread":0.2544189931938368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180751300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733549,0.0008247986,0.25493434,0.0027472656,0.0010840931,0.0003499057,0.00002084523,0.0006128336,0.0058769602],"genre_scores_gemma":[0.9830572,0.0000021077635,0.016254073,0.0005077809,0.00006426416,0.0000041490985,0.0000065167096,0.000004139514,0.00009979199],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988259,0.000046566423,0.00027840366,0.0003400358,0.00020043674,0.0003086559],"domain_scores_gemma":[0.998989,0.00013790993,0.000095143725,0.00067119993,0.000033064167,0.00007368603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022185572,0.00013496136,0.00020056442,0.00009455324,0.000056272045,0.00020278888,0.0013227197,0.00006659447,0.000009963034],"category_scores_gemma":[0.00021277554,0.00012177354,0.0000424697,0.00033923658,0.000013935851,0.0006491826,0.000098543285,0.00014839538,0.00007497222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005814128,0.00054200116,0.01783798,0.00013759971,0.000038396236,0.0008103021,0.017366268,0.0047856234,0.0019057003,0.016687732,0.008326505,0.9315038],"study_design_scores_gemma":[0.0070422487,0.0016885771,0.69196874,0.0030185957,0.00004611084,0.00029605473,0.0022743058,0.20378815,0.011828935,0.03830187,0.035505217,0.004241174],"about_ca_topic_score_codex":0.000046387253,"about_ca_topic_score_gemma":0.00007938207,"teacher_disagreement_score":0.9272626,"about_ca_system_score_codex":0.000028059643,"about_ca_system_score_gemma":0.000025979973,"threshold_uncertainty_score":0.4965781},"labels":[],"label_agreement":null},{"id":"W3185868054","doi":"10.1145/998300.997195","title":"Optimizing for space and time usage with speculative partial redundancy elimination","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Redundancy (engineering); Function (biology); Execution time; Space (punctuation); Distributed computing; Spacetime; Mathematical optimization; Parallel computing; Theoretical computer science; Operating system","score_opus":0.014952722086716188,"score_gpt":0.2465223292662858,"score_spread":0.23156960717956962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185868054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13014501,0.00025286354,0.8635341,0.0031825786,0.00017570723,0.0005204343,0.000036971436,0.00014179402,0.0020105692],"genre_scores_gemma":[0.8678822,0.00000277403,0.13181579,0.000054923446,0.00007865088,0.000019227786,0.000013413906,0.00000720366,0.00012584293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.000021357348,0.00014080039,0.00032588962,0.00016672774,0.00021753756],"domain_scores_gemma":[0.99926716,0.00014057767,0.000126458,0.000325297,0.00007165696,0.00006882714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016761813,0.00012357614,0.00015456253,0.000038686758,0.00015230753,0.0002302092,0.00035828387,0.000042887412,0.000002822527],"category_scores_gemma":[0.00007650716,0.00010033727,0.000022634771,0.00014697552,0.000045087836,0.0006099988,0.00007958752,0.000054663957,0.000014756681],"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.00048232128,0.0004725542,0.0014551803,0.0004709152,0.00031188448,0.00022778066,0.031898,0.079982474,0.01497124,0.8230082,0.0015065487,0.045212913],"study_design_scores_gemma":[0.02246559,0.0063214926,0.043088797,0.0028794617,0.000366309,0.0003427119,0.0021728647,0.727223,0.089723974,0.043200225,0.05741659,0.00479899],"about_ca_topic_score_codex":0.000034345623,"about_ca_topic_score_gemma":0.000013441944,"teacher_disagreement_score":0.779808,"about_ca_system_score_codex":0.000027894692,"about_ca_system_score_gemma":0.000037497208,"threshold_uncertainty_score":0.4091635},"labels":[],"label_agreement":null},{"id":"W3187155919","doi":"10.1145/1837852.1621609","title":"Eating our own dog food","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Transformational leadership; Code generation; Generative grammar; Domain-specific language; Programming language; Software engineering; Model-driven architecture; Model transformation; Code (set theory); Transformation (genetics); Domain (mathematical analysis); Program transformation; Rewriting; Artificial intelligence; Set (abstract data type); Software development; Software; Key (lock)","score_opus":0.022160992885089218,"score_gpt":0.26513472638124663,"score_spread":0.24297373349615742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187155919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041576497,0.00009959541,0.9545054,0.0012991719,0.00019535476,0.00011433666,0.0000026302816,0.0016144038,0.0005926174],"genre_scores_gemma":[0.5528316,0.0000025846086,0.4468029,0.00023962896,0.00007702476,0.0000045265865,0.0000017200484,0.000006138161,0.000033857024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988383,0.00002948567,0.00019819978,0.0003528769,0.0002619431,0.00031917414],"domain_scores_gemma":[0.9986564,0.00008287434,0.00008984067,0.001036101,0.000044074077,0.00009071394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019651957,0.00017034113,0.00016623735,0.00010642696,0.00008728518,0.00017665989,0.0018070446,0.00007733934,0.0000032325408],"category_scores_gemma":[0.000064704815,0.00015789717,0.000050880644,0.00023599042,0.000007371249,0.00052494876,0.00024899206,0.00017115258,0.000039373055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072752728,0.00016836335,0.007756375,0.00007263874,0.000062299696,0.00010538023,0.0030019502,0.0056951693,0.0036941173,0.2850094,0.008800839,0.68562615],"study_design_scores_gemma":[0.0022893837,0.00618183,0.14203066,0.0012106142,0.000111039015,0.00023174126,0.000127595,0.45659053,0.07018604,0.0973988,0.2183892,0.005252567],"about_ca_topic_score_codex":0.000012391011,"about_ca_topic_score_gemma":0.0000037673053,"teacher_disagreement_score":0.6803736,"about_ca_system_score_codex":0.000028079256,"about_ca_system_score_gemma":0.00002231218,"threshold_uncertainty_score":0.64388597},"labels":[],"label_agreement":null},{"id":"W3207435583","doi":"10.1145/3156695.3122958","title":"Packrats parse in packs","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Magna International (Canada)","funders":"","keywords":"Haskell; Computer science; Programming language; Parsing; Rule-based machine translation; Simple (philosophy); Functional programming; Parsing expression grammar; Set (abstract data type); Grammar; Rank (graph theory); Artificial intelligence; L-attributed grammar; Context-free grammar","score_opus":0.04969531986903357,"score_gpt":0.2923585841689749,"score_spread":0.24266326429994134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207435583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6744265,0.0018577165,0.059874613,0.00996098,0.009810771,0.0015755068,0.000009624734,0.0011351391,0.24134916],"genre_scores_gemma":[0.9963927,0.000009334396,0.0026770346,0.00013421958,0.00015714184,0.000011959865,0.0000022351767,0.000006550211,0.0006087859],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988828,0.00005732924,0.00018619385,0.000341093,0.00020282771,0.00032977923],"domain_scores_gemma":[0.99779665,0.00013400303,0.00019807153,0.0017529496,0.000032589065,0.00008570269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039642752,0.00012736747,0.00017772084,0.000060274,0.00024215844,0.0007241871,0.0026073456,0.00008117359,0.000012624317],"category_scores_gemma":[0.00038896117,0.00010134183,0.00004056824,0.0000705586,0.00006615286,0.00071619236,0.0005107437,0.00012265405,0.00032069057],"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.000018705168,0.00022462568,0.4665029,0.00010357115,0.00004705466,0.0006883105,0.0058725057,0.00002772101,0.00045666817,0.37454432,0.0061073145,0.14540629],"study_design_scores_gemma":[0.0030240188,0.00059456704,0.57239294,0.000078640536,0.000034270186,0.00006906908,0.00056857057,0.009451316,0.0038469147,0.19338556,0.21481755,0.0017365462],"about_ca_topic_score_codex":0.00060942763,"about_ca_topic_score_gemma":0.00093772623,"teacher_disagreement_score":0.32196626,"about_ca_system_score_codex":0.000016097889,"about_ca_system_score_gemma":0.000035212277,"threshold_uncertainty_score":0.6983353},"labels":[],"label_agreement":null},{"id":"W3211827173","doi":"10.1145/2775053.2658768","title":"Efficient testing of software product lines via centralization (short paper)","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Software product line; Test case; Code coverage; Product (mathematics); Software; Test (biology); Product line; Code (set theory); Reliability engineering; Software development; Programming language; Set (abstract data type); Machine learning","score_opus":0.04444085400109277,"score_gpt":0.2806092380191183,"score_spread":0.23616838401802553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211827173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085233495,0.00015944225,0.9132299,0.00010183065,0.00052525406,0.00012551199,0.000001674961,0.0005896238,0.000033271368],"genre_scores_gemma":[0.45546335,0.0000016248146,0.544403,0.000030192441,0.0000795263,0.000004045577,0.0000027642654,0.000008995781,0.000006479203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866354,0.000118145756,0.00028900048,0.00038454408,0.0002603129,0.0002844738],"domain_scores_gemma":[0.9960257,0.0027126218,0.00013611667,0.00089623226,0.00017263672,0.000056695077],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00057771534,0.00016243148,0.00022336745,0.00008640561,0.000076172386,0.000039598362,0.001025172,0.000046609428,0.000002230858],"category_scores_gemma":[0.01687155,0.00014319422,0.000033822722,0.0004424219,0.000050450013,0.00020805025,0.00031038196,0.00009833572,0.000006283713],"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.00000338848,0.00003337894,0.011243868,0.000122068166,0.00001009516,0.000002289339,0.0003450653,0.85257286,0.009339751,0.0005682022,0.000025616544,0.12573339],"study_design_scores_gemma":[0.0005817693,0.0005471714,0.13110285,0.00046968248,0.00007714939,0.000044049953,0.000059059585,0.67895454,0.16964337,0.014665945,0.0023903288,0.0014641004],"about_ca_topic_score_codex":0.000014119607,"about_ca_topic_score_gemma":0.00000274603,"teacher_disagreement_score":0.37022984,"about_ca_system_score_codex":0.000017796541,"about_ca_system_score_gemma":0.000021661632,"threshold_uncertainty_score":0.9914098},"labels":[],"label_agreement":null},{"id":"W3213724464","doi":"10.1145/3022671.2983991","title":"Call graphs for languages with parametric polymorphism","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Call graph; Computer science; Bytecode; Programming language; Compiler; Java bytecode; Java; Scala; Graph; Program analysis; Theoretical computer science; Context (archaeology); Static analysis; Parallel computing; Java applet; Java annotation","score_opus":0.023325452540513162,"score_gpt":0.2566854257306598,"score_spread":0.23335997319014662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213724464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11164425,0.0026349819,0.87039423,0.004385641,0.001214286,0.0012572453,0.000019285742,0.0010097723,0.007440333],"genre_scores_gemma":[0.9844457,0.000008782525,0.013992374,0.00018234583,0.000111565874,0.000046394554,0.0000028288396,0.0000117279815,0.0011982775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988769,0.000037988215,0.00015324929,0.0003634662,0.00021854941,0.00034979408],"domain_scores_gemma":[0.998288,0.00070451846,0.00012976826,0.0007153341,0.00006368093,0.0000987124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022786148,0.00014622771,0.00017648948,0.00015322976,0.00009828241,0.00014242895,0.0011187212,0.000065923545,0.000008297109],"category_scores_gemma":[0.00022289269,0.00007632181,0.000055904777,0.00034381333,0.000058441135,0.0003200641,0.00011933871,0.000043588,0.00008060186],"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.00007172067,0.00016535068,0.049561087,0.0001277914,0.00017323659,0.00012103242,0.0012684019,0.000007937714,0.001188725,0.6987445,0.0063598785,0.24221036],"study_design_scores_gemma":[0.016618378,0.009954332,0.108398885,0.00028770478,0.00045730887,0.0005403255,0.0010872599,0.002712317,0.03985066,0.26015797,0.5540314,0.0059035276],"about_ca_topic_score_codex":0.0001984038,"about_ca_topic_score_gemma":0.00010359195,"teacher_disagreement_score":0.8728014,"about_ca_system_score_codex":0.000015098613,"about_ca_system_score_gemma":0.000033980632,"threshold_uncertainty_score":0.31123132},"labels":[],"label_agreement":null},{"id":"W4214593058","doi":"10.1145/2544173.2509543","title":"Interacting with dead objects","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Snapshot (computer storage); Debugging; Programming language; Java; Operating system; Architecture; Virtual machine; Memory leak; Machine code; Program code; Code (set theory); Garbage collection; Compiler","score_opus":0.016281719968047823,"score_gpt":0.2496649981974478,"score_spread":0.23338327822939997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214593058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16016096,0.000091422204,0.81409496,0.0016113707,0.0003142711,0.00028507793,4.7457382e-7,0.0014976673,0.021943811],"genre_scores_gemma":[0.658859,0.0000020518314,0.34064347,0.00029900286,0.000032746466,0.000009459509,0.000001355488,0.0000053657645,0.00014755018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.000042855627,0.00013524445,0.0002573588,0.000154432,0.00021482784],"domain_scores_gemma":[0.9987399,0.00042639827,0.000115483184,0.0005612244,0.00009213815,0.00006485118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010651025,0.000111519155,0.00010791765,0.00008088353,0.000114490926,0.00036279947,0.0010736192,0.000034513643,0.00002967354],"category_scores_gemma":[0.00019490563,0.00008440471,0.0000194488,0.0002106594,0.000021395414,0.0007781183,0.0002735844,0.00011388698,0.00017803191],"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.000089466586,0.00083282305,0.11425435,0.00037283366,0.00044303812,0.00031235165,0.034222204,0.094805755,0.0056785536,0.042883653,0.11283882,0.5932662],"study_design_scores_gemma":[0.0008684936,0.0007354513,0.018792208,0.00045681567,0.00002405246,0.00011714085,0.00047354068,0.9433143,0.022919321,0.006233191,0.0047886944,0.0012767548],"about_ca_topic_score_codex":0.00015772942,"about_ca_topic_score_gemma":0.000015860103,"teacher_disagreement_score":0.8485086,"about_ca_system_score_codex":0.000012996643,"about_ca_system_score_gemma":0.00002573088,"threshold_uncertainty_score":0.34984836},"labels":[],"label_agreement":null},{"id":"W4229515876","doi":"10.1145/2954679.2872395","title":"LDX","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Compiler; Overhead (engineering); Determinism; Causality (physics); Event (particle physics); Scheme (mathematics); Programming language","score_opus":0.03440186732557786,"score_gpt":0.26521696658363564,"score_spread":0.23081509925805777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229515876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20937411,0.0002514186,0.75235724,0.022133783,0.0018223784,0.00013718216,0.0000046068876,0.000805602,0.013113687],"genre_scores_gemma":[0.9680399,0.000007196099,0.031070432,0.0005000223,0.00015285419,0.0000027302399,4.4786097e-7,0.0000034497205,0.00022298175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992897,0.00003506433,0.0001223628,0.00023713325,0.000146873,0.00016890121],"domain_scores_gemma":[0.99850607,0.0005953008,0.00006694276,0.00074039854,0.0000368876,0.000054399625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018284774,0.00006645279,0.00006640901,0.00004417444,0.00009843583,0.00009809792,0.0014462017,0.000033987177,0.00005349959],"category_scores_gemma":[0.0002818503,0.000044243,0.000025298428,0.0001381745,0.000029530956,0.00041051718,0.00026575665,0.000039493312,0.00055602856],"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.000007603376,0.00007572403,0.011111113,0.000023001756,0.000027693455,0.000020967349,0.0019644955,0.000023253104,0.0067689563,0.5301059,0.011765395,0.43810588],"study_design_scores_gemma":[0.0021788913,0.00035166086,0.09829841,0.0003496491,0.000026398819,0.000077113866,0.00019125573,0.025784057,0.069828585,0.1342942,0.6669495,0.0016702486],"about_ca_topic_score_codex":0.000010544075,"about_ca_topic_score_gemma":0.0000036565364,"teacher_disagreement_score":0.75866574,"about_ca_system_score_codex":0.0000130904245,"about_ca_system_score_gemma":0.00002239803,"threshold_uncertainty_score":0.7146808},"labels":[],"label_agreement":null},{"id":"W4229576726","doi":"10.1145/1273442.1250769","title":"Path invariants","year":2007,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Predicate abstraction; Computer science; Predicate (mathematical logic); Path (computing); Abstract interpretation; Program analysis; Theoretical computer science; Abstraction; Counterexample; Spurious relationship; Path expression; Programming language; Control flow; Invariant (physics); Control flow graph; Algorithm; Model checking; Mathematics; Discrete mathematics","score_opus":0.04224519862286649,"score_gpt":0.31248323854479454,"score_spread":0.2702380399219281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229576726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078272745,0.00007626291,0.9043868,0.0002980086,0.00094686396,0.0001084956,0.0000015687259,0.00023241296,0.015676836],"genre_scores_gemma":[0.4623894,0.0000027247324,0.5371617,0.00030305333,0.00006931418,0.0000015290701,0.0000013743122,0.0000037900677,0.00006708102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901265,0.0000539345,0.00019416027,0.00024511342,0.00023201849,0.00026214612],"domain_scores_gemma":[0.99851364,0.0003216535,0.00010778482,0.00093219744,0.000043615808,0.00008113057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012469823,0.0000876136,0.000087464134,0.00008134698,0.00008819819,0.00010485905,0.0016143658,0.000058733185,0.000019581212],"category_scores_gemma":[0.0007308235,0.00007862862,0.00002279486,0.00029200988,0.000030972613,0.00069430633,0.00027408794,0.00010342019,0.00025998938],"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.00003427447,0.00013201313,0.01234378,0.000063781685,0.000028396757,0.000103024984,0.00338301,0.000049741964,0.007315532,0.6356798,0.0022011346,0.33866554],"study_design_scores_gemma":[0.0012656406,0.000570662,0.6975767,0.00013063724,0.000035731242,0.000107781845,0.00044901916,0.064207226,0.11621358,0.055124167,0.062863894,0.0014549651],"about_ca_topic_score_codex":0.000031595187,"about_ca_topic_score_gemma":0.000012733236,"teacher_disagreement_score":0.68523294,"about_ca_system_score_codex":0.000021509348,"about_ca_system_score_gemma":0.000023693725,"threshold_uncertainty_score":0.33417243},"labels":[],"label_agreement":null},{"id":"W4229867184","doi":"10.1145/2714064.2660229","title":"Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"U.S. Department of Energy; International Business Machines Corporation; National Science Foundation","keywords":"Executable; Computer science; Software versioning; Compiler; Heuristic; Code (set theory); Space (punctuation); Set (abstract data type); Function (biology); Programming language; Mathematical optimization; Algorithm; Software; Operating system; Mathematics","score_opus":0.03233717448432247,"score_gpt":0.29041758950844254,"score_spread":0.25808041502412005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229867184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002532514,0.00003732949,0.9932847,0.0008482657,0.00026549288,0.0006562539,0.000005830918,0.0012355257,0.0011341062],"genre_scores_gemma":[0.34078553,0.0000039973784,0.65878737,0.00014665541,0.000058109723,0.000060620772,0.000015901187,0.000012683249,0.00012913275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854296,0.000099639205,0.00025145913,0.0005046692,0.00022459638,0.0003766861],"domain_scores_gemma":[0.9981692,0.0005361727,0.0002157589,0.00071158534,0.00023982515,0.00012748252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172729,0.00020083398,0.00021193239,0.00017445958,0.0004476457,0.00028517516,0.0013432876,0.00009651677,0.0000051348125],"category_scores_gemma":[0.0005251728,0.00018827694,0.00008747559,0.0003966814,0.0000649824,0.0002477104,0.0004426041,0.00012130157,0.000026178557],"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.000011772658,0.00021515349,0.00036485936,0.000018820063,0.000023908418,0.0000012337835,0.0008173399,0.96644807,0.000034291945,0.016745977,0.0018114011,0.013507175],"study_design_scores_gemma":[0.00052147807,0.00026976084,0.0004004568,0.000050597973,0.000014926215,0.000002166857,0.000041090487,0.99351853,0.00057207956,0.00024346207,0.004107212,0.00025824897],"about_ca_topic_score_codex":0.000020499165,"about_ca_topic_score_gemma":0.000006996861,"teacher_disagreement_score":0.338253,"about_ca_system_score_codex":0.00004080865,"about_ca_system_score_gemma":0.000052565392,"threshold_uncertainty_score":0.76777107},"labels":[],"label_agreement":null},{"id":"W4230438372","doi":"10.1145/2954679.2872398","title":"Sidewinder","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Computer science; Software portability; Interface (matter); Embedded system; Software deployment; Mobile device; Participatory sensing; Real-time computing; Operating system","score_opus":0.041802953478724536,"score_gpt":0.2607015934689875,"score_spread":0.218898639990263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230438372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39716205,0.00031645104,0.54345226,0.025881302,0.0030519643,0.0005301383,0.000032509688,0.001468394,0.028104935],"genre_scores_gemma":[0.99501145,0.000003315411,0.0031286802,0.0005476866,0.00016400195,0.000013519204,7.797339e-7,0.000008892004,0.0011216665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988017,0.0000937562,0.0001898703,0.00037085477,0.0002775387,0.00026627837],"domain_scores_gemma":[0.997498,0.001229768,0.00011414103,0.0009747111,0.0000816027,0.0001018211],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025071987,0.00012568994,0.0001552397,0.00009318157,0.00007943753,0.00015454162,0.001316003,0.000060669397,0.00017950153],"category_scores_gemma":[0.00044210858,0.00008244386,0.000054530836,0.00017409601,0.000037031656,0.0011564129,0.00036809602,0.000058272843,0.0019869895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014594083,0.000100003395,0.023842996,0.000028194718,0.00008461884,0.000079508274,0.0010173639,0.0000021918522,0.017370116,0.007470644,0.013269414,0.9367204],"study_design_scores_gemma":[0.0063159713,0.00077464187,0.18726844,0.0009554646,0.00008910762,0.00046357754,0.0004894524,0.0023619274,0.12939388,0.051169142,0.61714536,0.0035730402],"about_ca_topic_score_codex":0.000051559055,"about_ca_topic_score_gemma":0.00007310905,"teacher_disagreement_score":0.9331473,"about_ca_system_score_codex":0.00003078027,"about_ca_system_score_gemma":0.00004548726,"threshold_uncertainty_score":0.9987901},"labels":[],"label_agreement":null},{"id":"W4231154768","doi":"10.1145/2499369.2465572","title":"A two-step optimization technique for functions placement, partitioning, and priority assignment in distributed systems","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software deployment; Scheduling (production processes); Distributed computing; Integer programming; Implementation; Execution time; Linear programming; Mathematical optimization; Algorithm; Operating system; Software engineering","score_opus":0.018810438735579065,"score_gpt":0.25966782428337354,"score_spread":0.24085738554779448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231154768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009529216,0.000113347385,0.9874472,0.00024304414,0.00027719457,0.0019101204,0.000023011578,0.00013372465,0.0003231427],"genre_scores_gemma":[0.8758041,0.0000039771917,0.12268958,0.000020210353,0.00006350869,0.0012846561,0.00006541893,0.000009854003,0.00005864671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985874,0.00013000148,0.00038563562,0.00040441373,0.00019874476,0.00029377325],"domain_scores_gemma":[0.99868333,0.00038026556,0.000226494,0.0005068812,0.00010749311,0.00009551166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755679,0.00015243488,0.00020355608,0.00011657234,0.00016764966,0.0005496666,0.00040773864,0.00007921983,0.000010521735],"category_scores_gemma":[0.00022910576,0.00014328274,0.000026695983,0.0002528892,0.000026769561,0.0009762457,0.00017595188,0.00009585403,0.000014827674],"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.000026173053,0.00023244544,0.041383065,0.00044282665,0.000083374274,0.000007810936,0.0007872823,0.93684584,0.0059095467,0.010214923,0.0024282304,0.0016384958],"study_design_scores_gemma":[0.0008248541,0.00014633128,0.004465875,0.00019039103,0.00001672502,0.000014477829,0.0003198676,0.9926447,0.00046764375,0.00028536303,0.00036178582,0.0002619305],"about_ca_topic_score_codex":0.0006971086,"about_ca_topic_score_gemma":0.00005568544,"teacher_disagreement_score":0.86627495,"about_ca_system_score_codex":0.000107784006,"about_ca_system_score_gemma":0.0000460055,"threshold_uncertainty_score":0.58429},"labels":[],"label_agreement":null},{"id":"W4231963396","doi":"10.1145/3022671.2984033","title":"Modeling and analysis of remote memory access programming","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"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; Semantics (computer science); Programming language; Programming paradigm; Operational semantics; Memory model; Architecture; Documentation; Distributed computing; Theoretical computer science; Shared memory; Operating system","score_opus":0.0330069517125789,"score_gpt":0.2812463528318549,"score_spread":0.248239401119276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231963396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7162486,0.00013196845,0.28212488,0.0009687838,0.0000649987,0.00006361276,8.2088803e-7,0.000090545596,0.00030581155],"genre_scores_gemma":[0.96498436,0.00000752063,0.034787245,0.000065956985,0.00003139788,8.5894317e-7,5.456471e-7,0.000004430795,0.00011770635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899703,0.00004066527,0.00021276998,0.0003326332,0.00021958881,0.00019731057],"domain_scores_gemma":[0.9988747,0.00022898214,0.000106794636,0.00068611116,0.00004519215,0.000058173882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035354224,0.00009820488,0.00020551174,0.00026951352,0.0000785634,0.00013285226,0.0012416494,0.000030786898,0.0000033586175],"category_scores_gemma":[0.00011684543,0.000063040985,0.00006501361,0.0005944465,0.00003606791,0.00007592915,0.0011017337,0.000039387916,0.0000021910187],"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.000005504841,0.000021949098,0.0030405936,0.000037643407,0.0003519938,0.000008638894,0.00073622656,0.048514184,0.00014269789,0.00052467006,0.000020438429,0.94659543],"study_design_scores_gemma":[0.0001583879,0.000028212608,0.0024580602,0.00005918696,0.0001792405,8.717956e-7,0.000045015433,0.9960952,0.00019986602,0.00037576878,0.0002798821,0.0001203569],"about_ca_topic_score_codex":0.00020340354,"about_ca_topic_score_gemma":0.000040556264,"teacher_disagreement_score":0.947581,"about_ca_system_score_codex":0.0000101609985,"about_ca_system_score_gemma":0.0000090797585,"threshold_uncertainty_score":0.25707367},"labels":[],"label_agreement":null},{"id":"W4232254920","doi":"10.1145/3155284.3019035","title":"POSTER","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Computer science; Thread (computing); Lock (firearm); Reuse; Implementation; Parallel computing; Transformation (genetics); Overhead (engineering); Distributed computing; Theoretical computer science; Computer engineering; Programming language","score_opus":0.03146308960852579,"score_gpt":0.28513779538983663,"score_spread":0.25367470578131085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232254920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196656,0.0009075153,0.06399364,0.028848695,0.0077224392,0.0006076558,0.00011499986,0.0008506778,0.2772888],"genre_scores_gemma":[0.9959289,0.0000024044268,0.0027626678,0.00031082914,0.0001367628,0.0000044229328,0.0000030472206,0.0000042788697,0.0008466942],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992111,0.000018576076,0.0001292739,0.00025515855,0.0001746069,0.00021132827],"domain_scores_gemma":[0.9975924,0.000064186235,0.00015637859,0.0020708274,0.000044100518,0.00007209999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281684,0.0000924505,0.0001206993,0.000021564523,0.00037023687,0.00093135855,0.0033353672,0.00004461581,0.000016459313],"category_scores_gemma":[0.00018349609,0.00007552884,0.000037278314,0.000031407573,0.000040453313,0.00091705756,0.00051627465,0.00006994956,0.00042090306],"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.000054885295,0.00036954388,0.23898104,0.00025411727,0.00022161027,0.0009291481,0.0047349925,0.000101851336,0.004169667,0.2432155,0.11139129,0.39557636],"study_design_scores_gemma":[0.001220115,0.00016885501,0.6257795,0.00017460914,0.000018324761,0.00005787433,0.000054869735,0.008401728,0.003249151,0.0056434167,0.35436815,0.00086340477],"about_ca_topic_score_codex":0.00011689161,"about_ca_topic_score_gemma":0.00003925686,"teacher_disagreement_score":0.39471295,"about_ca_system_score_codex":0.0000075019193,"about_ca_system_score_gemma":0.00001797797,"threshold_uncertainty_score":0.8981112},"labels":[],"label_agreement":null},{"id":"W4232351578","doi":"10.1145/1168918.1168908","title":"A probabilistic pointer analysis for speculative optimizations","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Abstract interpretation; Optimizing compiler; Compiler; Correctness; Probabilistic logic; Test suite; Static analysis; Theoretical computer science; Algorithm; Program analysis; Programming language; Parallel computing; Test case; Artificial intelligence","score_opus":0.021831917528158967,"score_gpt":0.2729642003128487,"score_spread":0.2511322827846897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232351578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003290951,0.00003865282,0.9918301,0.00080376165,0.00006612877,0.0002683737,0.000012387858,0.0004433085,0.0032463465],"genre_scores_gemma":[0.4931404,9.3138647e-7,0.506248,0.00010395854,0.00004775646,0.000026385307,0.000047447647,0.0000055337496,0.00037959358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898684,0.00004799673,0.00025267364,0.00036212621,0.00013913216,0.0002112471],"domain_scores_gemma":[0.99860334,0.0004288439,0.00014844937,0.0006058813,0.0001728984,0.00004056458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001729411,0.00012870874,0.00019253977,0.00025518663,0.00016172118,0.00022133715,0.00085943553,0.00004754724,0.000017238313],"category_scores_gemma":[0.00022402462,0.00011627984,0.0001270365,0.0008248682,0.000036654987,0.00026060815,0.00016544723,0.00005037496,0.000009628323],"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.000006009104,0.00007495496,0.002258647,0.000011505952,0.000106053405,0.0000021598032,0.00020836988,0.9318762,0.000012670457,0.062528595,0.002632383,0.00028248885],"study_design_scores_gemma":[0.00022429833,0.000053814612,0.0043359236,0.000008929515,0.00010708535,0.0000010727673,0.000007446651,0.9744432,0.00028482382,0.019513724,0.00082872564,0.00019094242],"about_ca_topic_score_codex":0.00007072659,"about_ca_topic_score_gemma":0.00005978493,"teacher_disagreement_score":0.48984945,"about_ca_system_score_codex":0.000028036935,"about_ca_system_score_gemma":0.000028415421,"threshold_uncertainty_score":0.47417542},"labels":[],"label_agreement":null},{"id":"W4232927598","doi":"10.1145/2578856.2508174","title":"Optimizing MATLAB feval with dynamic techniques","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Solver; Function (biology); Interpreter; Programming language; Argument (complex analysis); Computational science; Feature (linguistics); Computer engineering; Algorithm; Parallel computing","score_opus":0.011059474827654077,"score_gpt":0.24610750590728117,"score_spread":0.2350480310796271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232927598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022054678,0.00013450446,0.96584433,0.0017933855,0.00008834683,0.00037038221,0.0000012182068,0.0025816795,0.007131476],"genre_scores_gemma":[0.4168426,0.000013570801,0.58254355,0.00031798845,0.000021992986,0.000030611685,0.000004208718,0.000011724214,0.00021372022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987169,0.00006189082,0.00021746613,0.0004082737,0.00026105618,0.00033441474],"domain_scores_gemma":[0.9985334,0.00017927523,0.00015194473,0.0009070996,0.00013447717,0.00009378106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018362825,0.00019801219,0.00018993628,0.00015429617,0.00017347104,0.00050461973,0.001698951,0.0000794345,0.000036299953],"category_scores_gemma":[0.000059832455,0.00015425682,0.000035733494,0.00032397735,0.00005727176,0.00086587,0.00040842153,0.00016181426,0.00011221861],"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.00012404138,0.001075273,0.010932853,0.0005487585,0.0005142631,0.00034665668,0.012009537,0.06410308,0.015866831,0.05165565,0.062939264,0.7798838],"study_design_scores_gemma":[0.0005656872,0.0007431288,0.003926448,0.00030650638,0.000031868036,0.00010857874,0.00014100442,0.9544773,0.025347931,0.0076850886,0.0052991235,0.0013673424],"about_ca_topic_score_codex":0.000111562804,"about_ca_topic_score_gemma":0.000009940132,"teacher_disagreement_score":0.89037424,"about_ca_system_score_codex":0.000033882625,"about_ca_system_score_gemma":0.000040920764,"threshold_uncertainty_score":0.6290411},"labels":[],"label_agreement":null},{"id":"W4233006693","doi":"10.1145/3140607.3050766","title":"Safe Inspection of Live Virtual Machines","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Troubleshooting; Virtual machine; Cloud computing; Live migration; Operating system; Virtualization; Reuse; Embedded system; Real-time computing","score_opus":0.019740399923071507,"score_gpt":0.26111331532126686,"score_spread":0.24137291539819536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233006693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789973,0.00006699081,0.0050608907,0.0017089397,0.0008175343,0.00008166722,0.0000016279788,0.00016003658,0.013105012],"genre_scores_gemma":[0.99355,0.0000032106639,0.005608894,0.00007706151,0.00017778589,0.000001471558,6.759334e-7,0.00000471361,0.000576166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992016,0.000033817672,0.00015828184,0.00024481743,0.00021200304,0.00014950612],"domain_scores_gemma":[0.99822867,0.00014734337,0.00026539635,0.0012782877,0.000038675913,0.000041608495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021511549,0.00009636652,0.00013283068,0.00006556677,0.00040449173,0.00020810074,0.0021532862,0.000034291916,0.000009500962],"category_scores_gemma":[0.0002541401,0.00007895827,0.000049112343,0.000051435443,0.00007778945,0.00007124054,0.0011115322,0.000082213395,0.000070406146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006466616,0.00044939184,0.079180196,0.00017158657,0.00026989586,0.000106598236,0.011690559,0.019919606,0.0013572475,0.09348769,0.007290416,0.7860122],"study_design_scores_gemma":[0.001095389,0.0007218028,0.4523221,0.00020476099,0.00005489851,0.000015706544,0.00043163562,0.5265725,0.002474141,0.0053010653,0.0101929605,0.00061302935],"about_ca_topic_score_codex":0.00049657206,"about_ca_topic_score_gemma":0.00007359613,"teacher_disagreement_score":0.78539914,"about_ca_system_score_codex":0.0000112285015,"about_ca_system_score_gemma":0.0000114025825,"threshold_uncertainty_score":0.40013772},"labels":[],"label_agreement":null},{"id":"W4233082099","doi":"10.1145/2578855.2535881","title":"Fair reactive programming","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Liveness; Mathematical proof; Linear logic; Computer science; Calculus (dental); Mathematics; Constructive; Fixed point; Type theory; Operational semantics; Normalization (sociology); Semantics (computer science); Algebra over a field; Theoretical computer science; Programming language; Type (biology); Pure mathematics","score_opus":0.02960920620908831,"score_gpt":0.29361434681604137,"score_spread":0.26400514060695307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233082099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047863115,0.00003043771,0.93935513,0.00062301796,0.0006307224,0.00018182717,7.2019486e-7,0.00042120737,0.010893804],"genre_scores_gemma":[0.45528185,6.9025725e-7,0.5444647,0.000119239085,0.000070672715,0.000011403629,0.00000151649,0.000004345014,0.00004558947],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989923,0.00013372362,0.0001486177,0.00029265258,0.00020858072,0.0002241214],"domain_scores_gemma":[0.99845797,0.00036306155,0.00012994246,0.00093022286,0.000055203116,0.0000635781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006622543,0.00009775971,0.00010525539,0.0000634532,0.00010278126,0.00015983357,0.0014089867,0.00005226826,0.0000050314416],"category_scores_gemma":[0.0011412066,0.0000864664,0.000029086235,0.00022568092,0.000041943465,0.0007864421,0.00025325597,0.0001156364,0.00015488661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007977767,0.000046842655,0.0015841413,0.000026126754,0.000013464327,0.0000027273152,0.0016199219,0.000054561864,0.001431377,0.23490447,0.00022821903,0.76008016],"study_design_scores_gemma":[0.0011063843,0.0011200664,0.08158761,0.00014942116,0.000057259665,0.00005501022,0.0005559571,0.29686764,0.09754089,0.0565424,0.46284816,0.0015691716],"about_ca_topic_score_codex":0.000033173554,"about_ca_topic_score_gemma":0.000006586953,"teacher_disagreement_score":0.758511,"about_ca_system_score_codex":0.000021647471,"about_ca_system_score_gemma":0.00001622404,"threshold_uncertainty_score":0.35259977},"labels":[],"label_agreement":null},{"id":"W4233224619","doi":"10.1145/1103845.1094848","title":"Incrementalization across object abstraction","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","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":"University of Manitoba","funders":"","keywords":"Computer science; Abstraction; Modular design; Implementation; Component (thermodynamics); Object (grammar); Programming language; Object-oriented programming; Distributed computing; Theoretical computer science; Artificial intelligence","score_opus":0.020050703969705014,"score_gpt":0.2933006812825095,"score_spread":0.27324997731280454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233224619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8222895,0.0003890896,0.16380095,0.0021151735,0.0012484269,0.0003059423,0.00005686682,0.00055182446,0.009242217],"genre_scores_gemma":[0.9929731,0.0000075997327,0.006296459,0.00024101735,0.00023261043,0.00000824905,0.000032014403,0.00000549612,0.0002034845],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990099,0.000030430023,0.00021810111,0.00026226623,0.00024433425,0.0002349733],"domain_scores_gemma":[0.9991828,0.00006629296,0.00013367705,0.0005102932,0.0000505626,0.00005633166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024607763,0.0001027847,0.00010435729,0.00002784765,0.00016836805,0.00028993224,0.0007374141,0.000056166904,0.00002523315],"category_scores_gemma":[0.0000617843,0.000095201496,0.000032185442,0.00019832494,0.000017627419,0.0011359748,0.000131919,0.00007322081,0.00032125623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008228451,0.0008666221,0.05235801,0.00026046156,0.00020443066,0.00008853912,0.015806498,0.039763335,0.024823796,0.041505005,0.04689382,0.7773472],"study_design_scores_gemma":[0.001981889,0.00022165921,0.20446348,0.00017358559,0.000025029663,0.000084756786,0.0009157725,0.20459472,0.026687924,0.00073564606,0.55891544,0.0012000701],"about_ca_topic_score_codex":0.00014512725,"about_ca_topic_score_gemma":0.00022409347,"teacher_disagreement_score":0.7761471,"about_ca_system_score_codex":0.000047560006,"about_ca_system_score_gemma":0.000017256058,"threshold_uncertainty_score":0.4129206},"labels":[],"label_agreement":null},{"id":"W4233884958","doi":"10.1145/1103845.1094823","title":"Parametric polymorphism for software component architectures","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"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; Programming language; Interface description language; Common Object Request Broker Architecture; Compiler; Component (thermodynamics); Component-based software engineering; Software; Software system; User interface","score_opus":0.031461366125061174,"score_gpt":0.26346490177681475,"score_spread":0.23200353565175358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233884958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092289075,0.0030610554,0.89601696,0.0042163013,0.0014377031,0.0009898238,0.000011392287,0.0009242963,0.001053414],"genre_scores_gemma":[0.89677286,0.000003343019,0.10200811,0.00048664052,0.00041541265,0.00004459212,0.00001077697,0.000012231457,0.00024605572],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985734,0.00005454388,0.00025324302,0.00041513852,0.0002789595,0.00042469296],"domain_scores_gemma":[0.99806476,0.0008107801,0.00015620454,0.0007902918,0.000052677216,0.00012526884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027697126,0.00018356286,0.0002255257,0.00019128837,0.00018667633,0.000239617,0.0015858727,0.00008199095,0.000013459384],"category_scores_gemma":[0.00037605249,0.00014356906,0.00010595631,0.00029852992,0.00004707192,0.00016331772,0.00024985475,0.000111971065,0.00013728648],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004652848,0.000331899,0.009108581,0.0001773244,0.00013562648,0.00003092769,0.0026261844,0.00261256,0.00032554698,0.10395935,0.0066260546,0.8740194],"study_design_scores_gemma":[0.003766387,0.0015006998,0.04254418,0.000042340496,0.00013465066,0.00020011365,0.00014740002,0.047274694,0.010656951,0.0994993,0.7919324,0.0023008876],"about_ca_topic_score_codex":0.00013071873,"about_ca_topic_score_gemma":0.000070937145,"teacher_disagreement_score":0.8717185,"about_ca_system_score_codex":0.000029931403,"about_ca_system_score_gemma":0.00003545168,"threshold_uncertainty_score":0.5854576},"labels":[],"label_agreement":null},{"id":"W4234392300","doi":"10.1145/1353536.1346301","title":"Predictor virtualization","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtualization; Memory hierarchy; Cache; Table (database); Operating system; Parallel computing; Embedded system; Database","score_opus":0.02957593603139608,"score_gpt":0.2567839502200828,"score_spread":0.22720801418868675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234392300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032770835,0.00010465722,0.9606217,0.00044323507,0.00023174014,0.00008714507,0.0000016464692,0.0011365924,0.0046024146],"genre_scores_gemma":[0.7990352,0.00004009737,0.2000402,0.00039971623,0.00008019661,0.0000049978194,0.000009221905,0.0000062741046,0.00038407918],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919033,0.000050767903,0.00015955245,0.00023759257,0.00020494942,0.00015679197],"domain_scores_gemma":[0.9990726,0.00014145537,0.000087418746,0.00057358353,0.00006554886,0.00005937072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114167866,0.0000920315,0.00009636308,0.000087747714,0.00018751342,0.00006335443,0.0010537228,0.000050655202,0.000014939996],"category_scores_gemma":[0.00020987139,0.00008487721,0.000027287202,0.0002605042,0.000036233978,0.00040863044,0.00022578878,0.0000620494,0.00006628668],"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.00007314228,0.00091321126,0.116464525,0.00015156672,0.00020379969,0.0004151577,0.023595557,0.13264349,0.002078077,0.32227543,0.3502717,0.050914336],"study_design_scores_gemma":[0.0007105049,0.00033939807,0.037695657,0.000059240192,0.000013257236,0.00010439555,0.000026765476,0.91353434,0.0072783646,0.0077112955,0.031787142,0.00073964475],"about_ca_topic_score_codex":0.000014955313,"about_ca_topic_score_gemma":0.0000015406836,"teacher_disagreement_score":0.7808908,"about_ca_system_score_codex":0.000012814386,"about_ca_system_score_gemma":0.000037005717,"threshold_uncertainty_score":0.34611923},"labels":[],"label_agreement":null},{"id":"W4234396608","doi":"10.1145/2544174.2500615","title":"Experience report","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Modular design; Computer science; Embedded system; Open source; Instrumentation (computer programming); Software engineering; Code (set theory); Source code; Gambit; Operating system; Programming language; Software; Simulation; Set (abstract data type)","score_opus":0.03905577636607352,"score_gpt":0.2778498679371863,"score_spread":0.23879409157111278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234396608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91971046,0.000109711335,0.057044383,0.0029926621,0.0014453593,0.0004575281,0.0000023485188,0.00062849507,0.017609049],"genre_scores_gemma":[0.9900568,0.0000016415268,0.008201923,0.0004535319,0.00012348409,0.00010049929,0.0000034264683,0.000008024711,0.0010506521],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985481,0.000067681874,0.00030208396,0.00046011107,0.0003426354,0.00027940274],"domain_scores_gemma":[0.99767447,0.00046027577,0.00019913686,0.0013871161,0.00014956511,0.0001294401],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020459927,0.00013760851,0.00017532504,0.00008238167,0.00011373862,0.00044324278,0.0015067551,0.000057917056,0.00027052438],"category_scores_gemma":[0.0005490345,0.00012278094,0.00005144368,0.00025413322,0.00004676359,0.0019673735,0.00043826803,0.00010262172,0.0019823087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011820537,0.00041700326,0.14310332,0.00012019462,0.0001482516,0.0016047781,0.022718683,0.000030008754,0.024690725,0.004990499,0.05154301,0.75062174],"study_design_scores_gemma":[0.0024133336,0.00062854675,0.45679,0.00046536664,0.000055650584,0.00553944,0.0054756384,0.033700906,0.070376545,0.018772254,0.40137324,0.0044090836],"about_ca_topic_score_codex":0.0006891986,"about_ca_topic_score_gemma":0.000046042383,"teacher_disagreement_score":0.7462126,"about_ca_system_score_codex":0.000023656681,"about_ca_system_score_gemma":0.00004225382,"threshold_uncertainty_score":0.99879473},"labels":[],"label_agreement":null},{"id":"W4234512893","doi":"10.1145/2365864.2151039","title":"SecondSite","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"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; Virtualization; Cloud computing; High availability; Virtual machine; Replication (statistics); Distributed computing; Computer network; Simple (philosophy); Operating system; Computer security","score_opus":0.020938015409281297,"score_gpt":0.24286578937683492,"score_spread":0.22192777396755362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234512893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540621,0.0008377458,0.008171149,0.0017832903,0.001125095,0.00008779616,7.7960283e-7,0.00040528606,0.03352675],"genre_scores_gemma":[0.98413014,0.0000013515014,0.01360425,0.00079207635,0.0003414571,0.0000023682808,9.2729596e-7,0.0000055558953,0.0011218644],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999134,0.00003931296,0.000116038966,0.00018158626,0.00017788465,0.0003511887],"domain_scores_gemma":[0.998889,0.00017570314,0.000060639595,0.0007502723,0.000014150805,0.00011023115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029622464,0.00009554135,0.00009077153,0.00006268116,0.0001142784,0.00011454983,0.0012279905,0.000030209843,0.00003503072],"category_scores_gemma":[0.000057423913,0.000078656594,0.000039350267,0.00017111267,0.000017421318,0.00007667408,0.00075067504,0.00008378434,0.00051864574],"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.000012102024,0.0005383657,0.09713872,0.000158142,0.00021272487,0.000061192724,0.015665634,0.0039368076,0.00072901516,0.10976068,0.051368877,0.72041774],"study_design_scores_gemma":[0.00087218947,0.00017741555,0.1700282,0.000075834476,0.000052496005,0.000051033487,0.0003814436,0.07863904,0.0028298327,0.0029819242,0.7427751,0.0011355022],"about_ca_topic_score_codex":0.000021022901,"about_ca_topic_score_gemma":0.0000026712119,"teacher_disagreement_score":0.71928227,"about_ca_system_score_codex":0.000010967708,"about_ca_system_score_gemma":0.000005882124,"threshold_uncertainty_score":0.66663146},"labels":[],"label_agreement":null},{"id":"W4234836192","doi":"10.1145/2345141.1967693","title":"Software debugging and testing using the abstract diagnosis theory","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Observability; Debugging; Dependency (UML); Program slicing; Controllability; Variable (mathematics); Set (abstract data type); Source code; A priori and a posteriori; Algorithm; Programming language; Theoretical computer science; Mathematics","score_opus":0.08703010010577043,"score_gpt":0.3037358530034371,"score_spread":0.21670575289766664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234836192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7836789,0.0044397274,0.1982977,0.00064609136,0.00058735954,0.0002892642,0.00000527483,0.01157454,0.00048113437],"genre_scores_gemma":[0.67097676,0.0000048214906,0.32848436,0.00036771028,0.00013603175,0.000013129828,5.7575124e-7,0.000011947027,0.0000046767796],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987884,0.00009677342,0.00019085965,0.00026689304,0.00021313014,0.00044392265],"domain_scores_gemma":[0.9890731,0.009813259,0.00016215409,0.0007819581,0.000057522728,0.00011202718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245781,0.0001764035,0.00014392535,0.0000769626,0.00048037982,0.00029772634,0.0010382332,0.00006226954,0.0000067645897],"category_scores_gemma":[0.006800782,0.00012252443,0.00003188054,0.000274821,0.00009463278,0.00075707445,0.0006098785,0.00019882439,0.00000913282],"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.000002727311,0.000043410815,0.7634576,0.00004244164,0.000023740167,0.000011153673,0.0018881672,0.0000692978,0.00010340013,0.0013168001,0.0012656299,0.23177561],"study_design_scores_gemma":[0.00044179623,0.00018096078,0.7764336,0.0010083341,0.00022058468,0.00052444247,0.00022934815,0.033048987,0.005072656,0.17916043,0.0020113883,0.0016674903],"about_ca_topic_score_codex":0.00018354246,"about_ca_topic_score_gemma":0.0000033127226,"teacher_disagreement_score":0.23010813,"about_ca_system_score_codex":0.000022319822,"about_ca_system_score_gemma":0.00003208309,"threshold_uncertainty_score":0.81416625},"labels":[],"label_agreement":null},{"id":"W4234858006","doi":"10.1145/1449955.1449792","title":"Typestate-like analysis of multiple interacting objects","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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; Static analysis; Heap (data structure); Programming language; Semantics (computer science); Abstract interpretation; Theoretical computer science; Program analysis; Operational semantics; Control flow; Set (abstract data type); Algorithm","score_opus":0.04006550644415848,"score_gpt":0.2688191604634197,"score_spread":0.2287536540192612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234858006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9270095,0.00033644927,0.064242326,0.00009443618,0.0012356801,0.00019977917,0.0000035114567,0.00026146238,0.0066168183],"genre_scores_gemma":[0.99341923,0.00000775074,0.0062278006,0.00005998342,0.00004441253,0.0000040866353,0.000010406913,0.000005807442,0.00022051389],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891543,0.000070057715,0.00027038358,0.00028752064,0.0002324372,0.00022415661],"domain_scores_gemma":[0.99822205,0.0006943877,0.00025362504,0.00067578605,0.0000896593,0.00006448678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002117152,0.00011414153,0.0002788185,0.00023641842,0.00010851066,0.000057535497,0.0009362278,0.000048525075,0.0000183935],"category_scores_gemma":[0.0003948704,0.00009312899,0.00011043279,0.0008385511,0.000044259596,0.00035280595,0.00023460241,0.00008918603,0.000059163507],"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.00005695969,0.000426467,0.8998628,0.00017409935,0.0022308,0.00040350214,0.04576854,0.005196462,0.0035873146,0.011641492,0.0014162039,0.02923534],"study_design_scores_gemma":[0.002936294,0.0012950283,0.42868966,0.00007590367,0.0016490436,0.00019041584,0.0045218198,0.48490542,0.030462379,0.0028482578,0.03988829,0.0025374915],"about_ca_topic_score_codex":0.0008282297,"about_ca_topic_score_gemma":0.00043786556,"teacher_disagreement_score":0.47970897,"about_ca_system_score_codex":0.000015023724,"about_ca_system_score_gemma":0.00003481424,"threshold_uncertainty_score":0.37976903},"labels":[],"label_agreement":null},{"id":"W4235258869","doi":"10.1145/2398857.2384653","title":"Taming MATLAB","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MATLAB; Computer science; Programming language; Extensibility; Python (programming language); Computational science; Software engineering","score_opus":0.035012490974413696,"score_gpt":0.2797654653868112,"score_spread":0.2447529744123975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235258869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23276561,0.0027196428,0.67581415,0.001681816,0.0030278657,0.0007791013,0.00000681958,0.004399975,0.07880499],"genre_scores_gemma":[0.8530628,0.0000036617,0.14608075,0.00029265173,0.00023784096,0.000016649514,0.00000142854,0.0000111594,0.00029306207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987332,0.00010591337,0.00021330365,0.00022705657,0.00028522554,0.00043524976],"domain_scores_gemma":[0.998201,0.00038116676,0.00012514833,0.0011259811,0.000037368718,0.00012930573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063601753,0.00013836131,0.00015651113,0.0001038547,0.000092806535,0.00016415272,0.0018048965,0.00007873266,0.000024039653],"category_scores_gemma":[0.00017987011,0.000121311496,0.000040585222,0.00023073585,0.000025138012,0.0013423269,0.00044218465,0.00011670122,0.00045277973],"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.000016920203,0.00043869755,0.093510255,0.00043492267,0.00015753516,0.000091427806,0.034859523,0.000025582382,0.04251294,0.5756812,0.08299971,0.16927125],"study_design_scores_gemma":[0.0016711128,0.00077165914,0.060816366,0.0008365893,0.0001350078,0.00051209074,0.001981369,0.017373675,0.48682103,0.039120026,0.38510612,0.0048549725],"about_ca_topic_score_codex":0.000059032456,"about_ca_topic_score_gemma":0.0000029428945,"teacher_disagreement_score":0.6202972,"about_ca_system_score_codex":0.000034166544,"about_ca_system_score_gemma":0.00001790178,"threshold_uncertainty_score":0.5819718},"labels":[],"label_agreement":null},{"id":"W4235270001","doi":"10.1145/2248487.2150992","title":"Comprehensive kernel instrumentation via dynamic binary translation","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Binary translation; sysfs; Configfs; Kernel (algebra); Instrumentation (computer programming); Operating system; Interrupt; Overhead (engineering); Call stack; Address space; Linux kernel; Embedded system; Stack (abstract data type); Software","score_opus":0.04684233178849168,"score_gpt":0.2998771654583499,"score_spread":0.25303483366985824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235270001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74058354,0.000755694,0.25546256,0.0010264689,0.0011664508,0.00017903297,0.0000031645475,0.00024924058,0.00057384354],"genre_scores_gemma":[0.9407584,0.00001549071,0.05873254,0.00033861297,0.000098651035,0.000006381239,0.00003305938,0.000006683304,0.000010160179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.000090601534,0.00021410406,0.00022125413,0.00021321484,0.00024730756],"domain_scores_gemma":[0.9989437,0.00034300785,0.0001347721,0.00045126723,0.000048584836,0.00007869882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016347399,0.00011498898,0.00010233355,0.00009477766,0.00018492555,0.000102352744,0.00066566234,0.000060949933,0.00002145042],"category_scores_gemma":[0.000022698569,0.00011860015,0.000037400743,0.000264875,0.000032451437,0.0012570593,0.00010677128,0.00010810177,0.00015705991],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064872496,0.00047574163,0.025796112,0.00022853218,0.000109599,0.000007922796,0.033171717,0.0029917022,0.028148754,0.021952821,0.00048327402,0.88656896],"study_design_scores_gemma":[0.00087572075,0.00017142794,0.21328527,0.00005225919,0.000031783213,0.00003614987,0.00060431054,0.76507324,0.003990671,0.00338978,0.0119079705,0.0005813953],"about_ca_topic_score_codex":0.000030332123,"about_ca_topic_score_gemma":0.000005055139,"teacher_disagreement_score":0.8859876,"about_ca_system_score_codex":0.00003562174,"about_ca_system_score_gemma":0.000017634768,"threshold_uncertainty_score":0.48363736},"labels":[],"label_agreement":null},{"id":"W4235443648","doi":"10.1145/2016603.1967692","title":"Lowering overhead in sampling-based execution monitoring and tracing","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Overhead (engineering); Debugging; Tracing; Sampling (signal processing); Embedded system; Distributed computing; Real-time computing; Software; Operating system","score_opus":0.06569044740153988,"score_gpt":0.2905479487889079,"score_spread":0.224857501387368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235443648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40543285,0.00015381318,0.59309477,0.000048429745,0.00015565722,0.00006570466,3.3503622e-7,0.000294896,0.0007535455],"genre_scores_gemma":[0.74497247,0.0000088369325,0.25495774,0.000022585862,0.00002462744,0.0000036543654,5.6494633e-7,0.000004611481,0.000004897227],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992358,0.000028620821,0.0001734717,0.0002617858,0.00010999661,0.00019028853],"domain_scores_gemma":[0.99937445,0.00015663936,0.00007579001,0.00032176464,0.000024079678,0.000047262496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025745213,0.00010073384,0.00011006275,0.00014923848,0.00008251429,0.00009263898,0.00045270284,0.000052293926,0.0000022432484],"category_scores_gemma":[0.000106743595,0.00010318762,0.000017328293,0.00018878841,0.000019816429,0.00036466302,0.00013764533,0.000105656596,0.0000027982533],"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.00014108661,0.0005180038,0.67261195,0.00038610442,0.000048051003,0.00016644868,0.027192734,0.12003345,0.007310166,0.0070671174,0.00012733384,0.16439757],"study_design_scores_gemma":[0.0010019215,0.00029568342,0.33594197,0.00077290565,0.000014214947,0.000014774575,0.00018164988,0.54929996,0.106487,0.004977086,0.00014735489,0.00086547283],"about_ca_topic_score_codex":0.00015363221,"about_ca_topic_score_gemma":0.000010949925,"teacher_disagreement_score":0.4292665,"about_ca_system_score_codex":0.000022508078,"about_ca_system_score_gemma":0.000018059061,"threshold_uncertainty_score":0.42078692},"labels":[],"label_agreement":null},{"id":"W4235527144","doi":"10.1145/3155284.3019027","title":"POSTER","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Software transactional memory; Transactional memory; Scalability; Software; Benchmark (surveying); Parallel computing; Database transaction; Operating system; Programming language","score_opus":0.03146308960852579,"score_gpt":0.28513779538983663,"score_spread":0.25367470578131085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235527144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196656,0.0009075153,0.06399364,0.028848695,0.0077224392,0.0006076558,0.00011499986,0.0008506778,0.2772888],"genre_scores_gemma":[0.9959289,0.0000024044268,0.0027626678,0.00031082914,0.0001367628,0.0000044229328,0.0000030472206,0.0000042788697,0.0008466942],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992111,0.000018576076,0.0001292739,0.00025515855,0.0001746069,0.00021132827],"domain_scores_gemma":[0.9975924,0.000064186235,0.00015637859,0.0020708274,0.000044100518,0.00007209999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281684,0.0000924505,0.0001206993,0.000021564523,0.00037023687,0.00093135855,0.0033353672,0.00004461581,0.000016459313],"category_scores_gemma":[0.00018349609,0.00007552884,0.000037278314,0.000031407573,0.000040453313,0.00091705756,0.00051627465,0.00006994956,0.00042090306],"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.000054885295,0.00036954388,0.23898104,0.00025411727,0.00022161027,0.0009291481,0.0047349925,0.000101851336,0.004169667,0.2432155,0.11139129,0.39557636],"study_design_scores_gemma":[0.001220115,0.00016885501,0.6257795,0.00017460914,0.000018324761,0.00005787433,0.000054869735,0.008401728,0.003249151,0.0056434167,0.35436815,0.00086340477],"about_ca_topic_score_codex":0.00011689161,"about_ca_topic_score_gemma":0.00003925686,"teacher_disagreement_score":0.39471295,"about_ca_system_score_codex":0.0000075019193,"about_ca_system_score_gemma":0.00001797797,"threshold_uncertainty_score":0.8981112},"labels":[],"label_agreement":null},{"id":"W4235950552","doi":"10.1145/1837853.1693509","title":"The pilot library for novice MPI programmers","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Software portability; Message Passing Interface; Message passing; Deadlock; Overhead (engineering); Interface (matter); Parallel computing; Programming language; Process (computing); Computation; Parallel programming model; Programming paradigm; Computer architecture","score_opus":0.022182920000890886,"score_gpt":0.25884928485433906,"score_spread":0.23666636485344816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235950552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5279096,0.0016242088,0.31854838,0.0705276,0.025961598,0.0052463138,0.00026407087,0.005933228,0.043985043],"genre_scores_gemma":[0.96838945,0.0000029137748,0.030094527,0.0004165866,0.0004656581,0.000047418718,0.00003217326,0.000014851156,0.0005364153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880135,0.000047606572,0.00021927852,0.00032592023,0.00019343253,0.00041241111],"domain_scores_gemma":[0.9972276,0.001472733,0.00014470499,0.0009985456,0.000048825637,0.00010761054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004016489,0.00014315835,0.00012585049,0.000031243915,0.00044116433,0.0009792147,0.0030932436,0.000053996155,0.000005157002],"category_scores_gemma":[0.00023433389,0.000095069954,0.00006105823,0.00024026276,0.0000667296,0.00047496497,0.0003628139,0.00019566876,0.000077587836],"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.00017574754,0.00044041473,0.01312999,0.00025984537,0.00021673823,0.00003201574,0.0021794878,0.00046657692,0.002224484,0.45312345,0.18368804,0.3440632],"study_design_scores_gemma":[0.00041712605,0.0003223383,0.0020522045,0.000020479538,0.000010654931,0.000014329521,0.000053649288,0.022892945,0.00042997775,0.0042181346,0.9692997,0.00026849066],"about_ca_topic_score_codex":0.00003174093,"about_ca_topic_score_gemma":0.0000544928,"teacher_disagreement_score":0.7856116,"about_ca_system_score_codex":0.0000035130852,"about_ca_system_score_gemma":0.00007745588,"threshold_uncertainty_score":0.944259},"labels":[],"label_agreement":null},{"id":"W4236702796","doi":"10.1145/2365864.2151044","title":"Execution mining","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"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; Artifact (error); Source code; Programming language; Code (set theory); Simple (philosophy); Execution model; Representation (politics); Software engineering; Distributed computing; Operating system; Set (abstract data type)","score_opus":0.02592149768555107,"score_gpt":0.26436625441099615,"score_spread":0.23844475672544507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236702796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97847515,0.00046306,0.01523228,0.00042606166,0.0016741282,0.000095207,9.690125e-7,0.0002981885,0.0033349772],"genre_scores_gemma":[0.97745365,0.000005158789,0.021990018,0.00017098125,0.00027551607,0.000007351802,0.0000022310269,0.000003898525,0.00009122267],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99916166,0.0000419138,0.0001496043,0.00016435902,0.00018579155,0.00029666946],"domain_scores_gemma":[0.99891967,0.0002173843,0.00007101253,0.0006720087,0.00003054467,0.00008936249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004441191,0.00008581314,0.00009940459,0.000046784393,0.00011331402,0.000064633314,0.0007265024,0.00005673133,0.000019204028],"category_scores_gemma":[0.00018230939,0.000066334105,0.000033741493,0.00017469499,0.000023309765,0.0011071255,0.00020897874,0.000060048296,0.00027455937],"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.000007959756,0.00011191648,0.9037698,0.00010151097,0.000023911562,0.0000037014354,0.007370861,0.00006736657,0.00044102155,0.0040197154,0.00457388,0.07950839],"study_design_scores_gemma":[0.00066963263,0.00019767342,0.90890163,0.00013781895,0.000034265704,0.00006552656,0.0007206678,0.009218301,0.008103407,0.00093597494,0.07017641,0.00083869434],"about_ca_topic_score_codex":0.000028045493,"about_ca_topic_score_gemma":0.0000032180462,"teacher_disagreement_score":0.07866969,"about_ca_system_score_codex":0.000021807147,"about_ca_system_score_gemma":0.000018393159,"threshold_uncertainty_score":0.35289967},"labels":[],"label_agreement":null},{"id":"W4237139188","doi":"10.1145/2578855.2535858","title":"Consistency analysis of decision-making programs","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Nondeterministic algorithm; Consistency (knowledge bases); Correctness; Solver; Program analysis; Algorithm; Set (abstract data type); Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.03471500761947407,"score_gpt":0.3257529702881921,"score_spread":0.29103796266871806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237139188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19846699,0.000058041973,0.79805344,0.00006043036,0.00024838516,0.000090220776,0.0000013866518,0.00009286024,0.0029282265],"genre_scores_gemma":[0.5243224,0.000001356347,0.47560802,0.000044510758,0.000012066773,0.0000034499908,0.0000017664828,0.0000023252078,0.0000041326184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987577,0.0001324404,0.0003328394,0.0002872954,0.00031732838,0.00017240134],"domain_scores_gemma":[0.997043,0.0012164714,0.00028625975,0.0012904553,0.000119375785,0.000044447956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009456091,0.00009409043,0.0002490585,0.00028383406,0.00007330783,0.000092595954,0.0015480408,0.00005343347,0.00001573254],"category_scores_gemma":[0.0021922942,0.00008051775,0.00010041519,0.0013087966,0.00007110805,0.0003670453,0.00026029762,0.00006692943,0.000019962923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009426059,0.00006097032,0.02439121,0.000022366974,0.00017440885,0.0000019347883,0.000716526,0.00096313754,0.00017040549,0.1064462,0.000025995585,0.8670174],"study_design_scores_gemma":[0.00018539645,0.00023206254,0.14646205,0.00011278482,0.00044105412,0.0000044328126,0.00009865287,0.82985324,0.0011307404,0.018997433,0.0021633971,0.00031875103],"about_ca_topic_score_codex":0.000021836213,"about_ca_topic_score_gemma":0.000033276323,"teacher_disagreement_score":0.8666987,"about_ca_system_score_codex":0.000012570634,"about_ca_system_score_gemma":0.000019737483,"threshold_uncertainty_score":0.32834187},"labels":[],"label_agreement":null},{"id":"W4237304536","doi":"10.1145/998300.997179","title":"ESys.Net","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Abstraction; Programming language; Software engineering; Task (project management); Systems engineering","score_opus":0.024783160107256598,"score_gpt":0.26727822276058694,"score_spread":0.24249506265333035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237304536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104196034,0.00076076295,0.8500983,0.0047279526,0.0012293606,0.0007011917,0.000008427833,0.00378637,0.034491595],"genre_scores_gemma":[0.8208065,0.0000051592383,0.178428,0.000473405,0.000107700136,0.000017817523,0.0000020606012,0.000011037546,0.00014833228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869055,0.00006312838,0.00024033028,0.00038019853,0.00031491465,0.00031090213],"domain_scores_gemma":[0.99815357,0.0001922988,0.00012088271,0.0013810454,0.00005268756,0.00009951399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033293944,0.0001555863,0.00017819552,0.00011465279,0.00009175305,0.00021815885,0.0024875898,0.000090418216,0.000013869981],"category_scores_gemma":[0.00018388976,0.00013799973,0.000050058934,0.00028375236,0.000038491307,0.0006728759,0.00037095856,0.00013243087,0.00043905096],"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.000019048588,0.00031388033,0.0038022972,0.00021087503,0.00011615061,0.0006215657,0.009621236,0.0009993418,0.027480587,0.8989861,0.023133809,0.03469512],"study_design_scores_gemma":[0.0025532616,0.001392973,0.007944033,0.00065587304,0.00005827266,0.0004148242,0.00037844523,0.0040714936,0.40990832,0.50758797,0.06233776,0.002696745],"about_ca_topic_score_codex":0.00016647148,"about_ca_topic_score_gemma":0.000059757363,"teacher_disagreement_score":0.7166105,"about_ca_system_score_codex":0.00005566494,"about_ca_system_score_gemma":0.0000668931,"threshold_uncertainty_score":0.5643258},"labels":[],"label_agreement":null},{"id":"W4237956829","doi":"10.1145/2016603.1967693","title":"Software debugging and testing using the abstract diagnosis theory","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Observability; Debugging; Dependency (UML); Program slicing; Controllability; Variable (mathematics); Source code; Set (abstract data type); A priori and a posteriori; Context (archaeology); Algorithm; Programming language; Theoretical computer science; Mathematics","score_opus":0.13478969035681715,"score_gpt":0.28714426921478553,"score_spread":0.15235457885796838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237956829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70259804,0.0017837764,0.27720702,0.00032957684,0.00044999245,0.00036189152,0.0000060599164,0.015738646,0.0015249824],"genre_scores_gemma":[0.6002288,0.000004180764,0.39942428,0.0002725113,0.000042641776,0.000012054494,3.4889828e-7,0.000010923539,0.000004296383],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998843,0.000084305575,0.00020359718,0.00036510752,0.0001855761,0.00031837393],"domain_scores_gemma":[0.9929953,0.0058162455,0.00017201704,0.0008655889,0.00007357816,0.00007724837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008414573,0.00017791717,0.0001458796,0.000084249805,0.00043587878,0.00023265558,0.0013385287,0.000062067375,0.000012095747],"category_scores_gemma":[0.0051964447,0.00012427682,0.000032784472,0.00026982938,0.000119639815,0.00046506085,0.0006170947,0.00019311874,0.0000074710138],"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.000008989212,0.00006867771,0.59460723,0.00006700737,0.000046557376,0.000096351774,0.005663409,0.000044985205,0.00011111838,0.0026232845,0.0011760789,0.39548633],"study_design_scores_gemma":[0.00033659683,0.00025708132,0.43777183,0.0008097811,0.00014855732,0.000325276,0.00018243493,0.027556665,0.0055642547,0.52556044,0.00032792156,0.0011591623],"about_ca_topic_score_codex":0.0005006721,"about_ca_topic_score_gemma":0.000010437142,"teacher_disagreement_score":0.5229372,"about_ca_system_score_codex":0.000015958414,"about_ca_system_score_gemma":0.000042626194,"threshold_uncertainty_score":0.62210053},"labels":[],"label_agreement":null},{"id":"W4237989195","doi":"10.1145/2398857.2384623","title":"Predicate abstraction of Java programs with collections","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Predicate abstraction; Programming language; Java; Java Modeling Language; Generics in Java; Predicate (mathematical logic); Java annotation; Scalability; Java concurrency; Model checking; Real time Java; Database","score_opus":0.034403413111657205,"score_gpt":0.2540499952875848,"score_spread":0.2196465821759276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237989195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4625489,0.001777936,0.39765954,0.0013148459,0.005356945,0.0027284196,0.000007731245,0.0018642579,0.12674141],"genre_scores_gemma":[0.9911511,0.0000042045767,0.007921224,0.000017473989,0.00015283565,0.000032480297,0.00000578076,0.000006644353,0.00070826034],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990884,0.00003997173,0.00018077245,0.00017227937,0.00024716847,0.00027140527],"domain_scores_gemma":[0.9990556,0.00009489352,0.00020649075,0.00047130315,0.000072846,0.00009881805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002685229,0.000098505414,0.00013094739,0.00007754401,0.0001398208,0.00010973996,0.00051783415,0.000058468027,0.000012506336],"category_scores_gemma":[0.000046205616,0.00007020529,0.00003177725,0.00043516076,0.000059398095,0.00059421477,0.00007986854,0.000086451386,0.00004720813],"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.00013169111,0.002809127,0.55930805,0.00065034226,0.00058030075,0.000028906421,0.016563484,0.00029453306,0.0019144121,0.19708312,0.0077686566,0.21286736],"study_design_scores_gemma":[0.0045798672,0.006700392,0.35168338,0.00018668767,0.00053878326,0.0007174648,0.003778457,0.007843985,0.036621854,0.016493686,0.56810373,0.0027517064],"about_ca_topic_score_codex":0.0003177062,"about_ca_topic_score_gemma":0.00010453452,"teacher_disagreement_score":0.56033504,"about_ca_system_score_codex":0.00001685338,"about_ca_system_score_gemma":0.00003874533,"threshold_uncertainty_score":0.2862889},"labels":[],"label_agreement":null},{"id":"W4238035143","doi":"10.1145/566225.513844","title":"Automatic formal verification for scheduled VLIW code","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Very long instruction word; Computer science; Compiler; Parallel computing; Code generation; Instruction-level parallelism; Software pipelining; Code (set theory); Programming language; Instruction scheduling; Optimizing compiler; Parallelism (grammar); Computer architecture; Operating system; Dynamic priority scheduling; Key (lock); Schedule","score_opus":0.06075935433410936,"score_gpt":0.28524307403290516,"score_spread":0.2244837196987958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238035143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06940523,0.00034102148,0.9220481,0.00151982,0.00048079755,0.0011499384,0.000016052882,0.0019375721,0.0031014683],"genre_scores_gemma":[0.7019299,0.0000048561365,0.2974791,0.00017209348,0.0000755738,0.00014167966,0.000005700057,0.000012597027,0.00017846613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858326,0.00007704566,0.00035259724,0.00035790371,0.0002619292,0.00036723854],"domain_scores_gemma":[0.9978837,0.0005058447,0.00022668108,0.0012089494,0.00009437311,0.00008049131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051967165,0.00016081241,0.00020520082,0.00012585983,0.0001717889,0.00023018853,0.0017914431,0.00010544731,0.000044701097],"category_scores_gemma":[0.00040531,0.00014896198,0.00006707478,0.00022756825,0.000032515236,0.0012436943,0.00015941229,0.00009063737,0.00020099398],"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.000037628335,0.0006570321,0.002290371,0.0015102072,0.00023733947,0.000041407653,0.013122532,0.00022095142,0.036589634,0.3966688,0.0825732,0.4660509],"study_design_scores_gemma":[0.0005233657,0.00027776146,0.0008462823,0.00009204939,0.00002344961,0.00002163116,0.00006346032,0.9592824,0.024505276,0.006159831,0.007804753,0.0003997586],"about_ca_topic_score_codex":0.000010953857,"about_ca_topic_score_gemma":0.000010320601,"teacher_disagreement_score":0.95906144,"about_ca_system_score_codex":0.000044745957,"about_ca_system_score_gemma":0.000018271836,"threshold_uncertainty_score":0.6074493},"labels":[],"label_agreement":null},{"id":"W4238222639","doi":"10.1145/354222.353194","title":"An Aristotelian understanding of object-oriented programming","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Jerome's University; University of Waterloo","funders":"","keywords":"Computer science; Object (grammar); Predicate (mathematical logic); Programming language; Logic programming; Object-oriented programming; Programming paradigm; First-order logic; Relation (database); Inductive programming; Epistemology; Artificial intelligence; Philosophy","score_opus":0.03571274590944432,"score_gpt":0.28869754795557623,"score_spread":0.2529848020461319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238222639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78482556,0.00014896879,0.21290123,0.00024784883,0.00027419924,0.00024135062,0.0000042193587,0.0006593147,0.0006973055],"genre_scores_gemma":[0.93115926,0.000005180158,0.06868841,0.000019206438,0.00004496684,0.0000059388994,0.0000048649013,0.000012246197,0.00005990333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867517,0.000049297538,0.00019093775,0.00032108076,0.00040776108,0.00035573862],"domain_scores_gemma":[0.998205,0.0006411654,0.000049631133,0.0009333025,0.000040965846,0.0001299219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032842817,0.000117909425,0.00014582743,0.00016465405,0.000098288496,0.0001298455,0.0013438092,0.000057926358,0.000066726345],"category_scores_gemma":[0.00037135914,0.00011334402,0.000035268185,0.0006183902,0.00006305262,0.0005230319,0.00010350627,0.0001521966,0.00003704518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013842144,0.0008857152,0.18756159,0.00052178744,0.00024027177,0.00033695932,0.021971531,0.017336464,0.0062241224,0.04287592,0.00089844025,0.7210088],"study_design_scores_gemma":[0.0071006897,0.007793868,0.37670627,0.0015241598,0.00018458194,0.00023696144,0.0058442163,0.43079337,0.061788235,0.01928112,0.08293978,0.0058067427],"about_ca_topic_score_codex":0.00013918188,"about_ca_topic_score_gemma":0.000021399132,"teacher_disagreement_score":0.71520203,"about_ca_system_score_codex":0.00007025001,"about_ca_system_score_gemma":0.000050046372,"threshold_uncertainty_score":0.46220347},"labels":[],"label_agreement":null},{"id":"W4238275896","doi":"10.1145/1103845.1094839","title":"Adding trace matching with free variables to AspectJ","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Computer science; Programming language; TRACE (psycholinguistics); Compiler; Semantics (computer science); Aspect-oriented programming; Programmer; Feature (linguistics); Software","score_opus":0.029708433143108032,"score_gpt":0.2764361334019181,"score_spread":0.24672770025881005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238275896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026530998,0.00019264343,0.9696307,0.0016250886,0.00021889475,0.00011670908,0.0000046865885,0.00091216125,0.0007680911],"genre_scores_gemma":[0.19426773,0.0000031550617,0.8051732,0.00025112007,0.00016070508,0.000012109388,8.0322394e-7,0.000017154343,0.000113979615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867904,0.000062118015,0.00017193586,0.00042767954,0.00026703862,0.00039216498],"domain_scores_gemma":[0.9963252,0.0022351125,0.000074064534,0.0012123104,0.00003965575,0.0001136868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000430824,0.00019235082,0.00020732853,0.00012224013,0.00012184663,0.00017723409,0.0022894659,0.00005204592,0.000012767094],"category_scores_gemma":[0.0016156196,0.00016042704,0.000024977773,0.00036306004,0.000021604892,0.0009064815,0.0005839158,0.00018701106,0.00005666911],"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.000018869585,0.000027769865,0.00023266677,0.000031478463,0.00003539863,0.00004515108,0.0033580556,0.91306067,0.0023769655,0.024322836,0.0007204213,0.055769708],"study_design_scores_gemma":[0.007865668,0.0037988098,0.05102878,0.0027487227,0.0003548208,0.000953796,0.0041860626,0.08300098,0.17459181,0.3944024,0.2647882,0.012279905],"about_ca_topic_score_codex":0.00002803123,"about_ca_topic_score_gemma":0.00006298441,"teacher_disagreement_score":0.8300597,"about_ca_system_score_codex":0.00005354976,"about_ca_system_score_gemma":0.00002990361,"threshold_uncertainty_score":0.65420246},"labels":[],"label_agreement":null},{"id":"W4238446011","doi":"10.1145/1837854.1736011","title":"AASH","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypervisor; Computer science; Multi-core processor; Operating system; Virtual machine; Asymmetry; Thread (computing); Virtualization; Embedded system; Parallel computing; Cloud computing","score_opus":0.01563478540086508,"score_gpt":0.2642665672501201,"score_spread":0.24863178184925502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238446011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11671321,0.00006219847,0.8400197,0.0033322491,0.0013968848,0.00014708303,0.0000020039809,0.0022774928,0.03604919],"genre_scores_gemma":[0.6163021,0.0000026925136,0.3830281,0.0003602261,0.0000782407,0.0000025158581,0.0000017068493,0.000003869107,0.00022059199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993227,0.000022748854,0.00011792446,0.00022571701,0.00014020977,0.00017069023],"domain_scores_gemma":[0.9988393,0.00017797093,0.00006485165,0.00080519286,0.000048278027,0.000064406035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019571683,0.000083440485,0.00008284167,0.00006787694,0.00010543839,0.00017768516,0.0016403074,0.000058924765,0.000032432847],"category_scores_gemma":[0.00022610623,0.00007392539,0.000027715801,0.00017110564,0.000029046321,0.00028529856,0.0003290757,0.00017318083,0.00013294799],"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.000017077386,0.00037972626,0.028502021,0.00006542235,0.00007376798,0.00010802647,0.0034921686,0.0049102027,0.02036335,0.53973967,0.115474455,0.28687415],"study_design_scores_gemma":[0.0009265427,0.00031464422,0.031548295,0.000054018652,0.00002327488,0.00009411794,0.000036233858,0.59109735,0.060743377,0.065459155,0.24813548,0.0015674755],"about_ca_topic_score_codex":0.000021050131,"about_ca_topic_score_gemma":0.000017001557,"teacher_disagreement_score":0.5861872,"about_ca_system_score_codex":0.0000033587423,"about_ca_system_score_gemma":0.000024499403,"threshold_uncertainty_score":0.30481264},"labels":[],"label_agreement":null},{"id":"W4238588277","doi":"10.1145/1508284.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"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; Cache; Multi-core processor; Parallel computing; Cache algorithms; Overhead (engineering); Cache invalidation; Smart Cache; Process (computing); Software; Code (set theory); Operating system; CPU cache; Programming language","score_opus":0.020706827356451817,"score_gpt":0.2700367176350224,"score_spread":0.24932989027857058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238588277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008295741,0.00027992862,0.95709765,0.0054904427,0.00022521843,0.00010255573,7.433196e-7,0.0015990675,0.026908658],"genre_scores_gemma":[0.6723591,0.000012333805,0.3260057,0.0013696135,0.000055072793,0.0000010652835,0.0000019532424,0.0000024641934,0.0001926696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992597,0.000037316127,0.00013423279,0.00023188606,0.00015097583,0.00018585597],"domain_scores_gemma":[0.99905044,0.000115140516,0.00006780104,0.00066759274,0.00004026228,0.000058781403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016722146,0.000091474314,0.00009953049,0.00007922452,0.00009917451,0.00015642104,0.001397215,0.00004293235,0.000012154402],"category_scores_gemma":[0.00012301137,0.000081463295,0.000032592994,0.00022486055,0.000013853447,0.0003128703,0.00012411388,0.00007729513,0.000075807475],"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.000021845743,0.00032334522,0.002022902,0.000022245142,0.000037438236,0.00009586505,0.0024032446,0.014896016,0.001701674,0.24140443,0.10517745,0.6318936],"study_design_scores_gemma":[0.0013239073,0.0013958622,0.039145928,0.00014100385,0.000027648632,0.00007402156,0.00004915911,0.66756725,0.031048423,0.1625974,0.09483474,0.0017946581],"about_ca_topic_score_codex":0.000006306586,"about_ca_topic_score_gemma":7.5444933e-7,"teacher_disagreement_score":0.6640634,"about_ca_system_score_codex":0.0000089489995,"about_ca_system_score_gemma":0.000019102978,"threshold_uncertainty_score":0.33219767},"labels":[],"label_agreement":null},{"id":"W4238850792","doi":"10.1145/1449955.1449786","title":"The impact of static-dynamic coupling on remodularization","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Static analysis; Modular design; Coupling (piping); Java; Programming language; Process (computing); Point (geometry); Mathematics","score_opus":0.02526368840728023,"score_gpt":0.30369978492059846,"score_spread":0.27843609651331824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238850792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92403793,0.000081098515,0.07534185,0.00017273745,0.000116833944,0.00010109194,0.0000027797869,0.000102830985,0.00004283874],"genre_scores_gemma":[0.9931431,0.000046665995,0.006717706,0.000008302169,0.000017439723,0.000003119963,0.0000034071988,0.000008722772,0.000051552543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990925,0.000023329143,0.00014329313,0.00016848602,0.00035348933,0.00021886564],"domain_scores_gemma":[0.99621254,0.0028064437,0.00006800096,0.00077961374,0.000084562824,0.00004884966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002805674,0.00008431575,0.00009216805,0.00008093588,0.00016042635,0.000059564518,0.0011345962,0.00003050219,0.0000028416541],"category_scores_gemma":[0.0020473928,0.000055503595,0.000041359555,0.0003155192,0.00005249706,0.00017980857,0.00014587856,0.00012106212,0.00002496479],"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.000054052416,0.00012524416,0.088288605,0.000042345553,0.00013264251,0.00006906642,0.0025337227,0.8804798,0.0070595504,0.002481374,0.0009783746,0.01775522],"study_design_scores_gemma":[0.00014010548,0.00019139782,0.26324356,0.000020971616,0.000001846296,0.0000068486156,0.000009307367,0.7348136,0.0010868352,0.0003653599,0.00003404292,0.0000861656],"about_ca_topic_score_codex":0.000083775965,"about_ca_topic_score_gemma":0.0000041331978,"teacher_disagreement_score":0.17495494,"about_ca_system_score_codex":0.000053863194,"about_ca_system_score_gemma":0.000083443716,"threshold_uncertainty_score":0.24510683},"labels":[],"label_agreement":null},{"id":"W4239027988","doi":"10.1145/1035292.1029010","title":"Pluggable verification modules","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Bytecode; Modular design; Programming language; Java; Extensibility; Operating system; Embedded system","score_opus":0.03169006507966655,"score_gpt":0.26264096082002336,"score_spread":0.23095089574035682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239027988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3624208,0.00034558514,0.6255103,0.0050219162,0.0009380792,0.00017376029,0.0000034182365,0.0006451525,0.0049410015],"genre_scores_gemma":[0.8831007,0.000010930511,0.116378635,0.0003379737,0.00011436054,0.000007079382,0.000007144376,0.0000052390446,0.000037936094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905825,0.00002834555,0.00018018234,0.00032769205,0.00020398265,0.00020156686],"domain_scores_gemma":[0.998702,0.00014669166,0.00010675313,0.0009232089,0.0000588594,0.00006248039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020794645,0.00009633082,0.00009174352,0.00007010397,0.0002093896,0.00022688716,0.0014535496,0.000054349126,0.000014957292],"category_scores_gemma":[0.00017732475,0.000096255615,0.000031937318,0.00028369896,0.000033941673,0.00060245965,0.0001782556,0.000095570154,0.0003120218],"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.000008874538,0.0001806337,0.0009936972,0.000050394257,0.000027604816,0.000012722431,0.005053045,0.020653348,0.004003212,0.93476105,0.0010106793,0.033244718],"study_design_scores_gemma":[0.0034638015,0.000462739,0.092488654,0.00030988676,0.000054651802,0.00009805636,0.0010257808,0.22162649,0.14362557,0.4176059,0.11694562,0.002292861],"about_ca_topic_score_codex":0.000093773306,"about_ca_topic_score_gemma":0.000010818229,"teacher_disagreement_score":0.5206799,"about_ca_system_score_codex":0.00004110895,"about_ca_system_score_gemma":0.00004736704,"threshold_uncertainty_score":0.40105128},"labels":[],"label_agreement":null},{"id":"W4239191916","doi":"10.1145/2398857.2384665","title":"Speculative analysis of integrated development environment recommendations","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"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; Code refactoring; Source code; Eclipse; Programming language; Software engineering; Code (set theory); Domain (mathematical analysis); Semantics (computer science); Executable; Software","score_opus":0.040113989935213284,"score_gpt":0.2883590507156111,"score_spread":0.2482450607803978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239191916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4788089,0.00016999518,0.5199729,0.00038511274,0.00019779694,0.0001245666,0.000013614247,0.00010911432,0.00021795023],"genre_scores_gemma":[0.79077375,0.00000546815,0.20906362,0.000017159127,0.000013128268,0.0000069549656,0.00004057205,0.000004051482,0.00007527146],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990796,0.000049014037,0.00020118048,0.00016611315,0.00026715535,0.00023694096],"domain_scores_gemma":[0.9982532,0.0010086872,0.00007554181,0.0005372215,0.00003197364,0.00009332995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036750588,0.00009084794,0.00015623885,0.00034741632,0.00004367906,0.000028944773,0.0007265282,0.000030816318,0.0002348059],"category_scores_gemma":[0.00047750727,0.00007975972,0.000042944957,0.00081452023,0.000024483621,0.0003019143,0.00031018327,0.0000863899,0.00009381256],"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.000008689055,0.00042642042,0.87397456,0.000030448544,0.002377269,0.000004560971,0.015775578,0.010554356,0.00129454,0.004337742,0.00094308367,0.09027278],"study_design_scores_gemma":[0.00011783387,0.000027671838,0.95424926,0.000015104261,0.00010773351,6.5231563e-7,0.00015105425,0.009086379,0.008396662,0.000029060036,0.027613139,0.00020545267],"about_ca_topic_score_codex":0.00003523238,"about_ca_topic_score_gemma":0.0000076117185,"teacher_disagreement_score":0.31196484,"about_ca_system_score_codex":0.000094128794,"about_ca_system_score_gemma":0.000032767195,"threshold_uncertainty_score":0.3252507},"labels":[],"label_agreement":null},{"id":"W4240395313","doi":"10.1145/2189751.2047884","title":"Monitoring aspects for the customization of automatically generated code for big-step models","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Executable; Code generation; Programming language; Code (set theory); Personalization; Redundant code; Generator (circuit theory); Unreachable code; Dead code; Semantics (computer science); Reachability; Source code; Extension (predicate logic); Operating system; Theoretical computer science","score_opus":0.1913483787223302,"score_gpt":0.3198090411456223,"score_spread":0.1284606624232921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240395313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061992276,0.00023097584,0.99165446,0.00007773564,0.0010152144,0.00042516663,0.000013640133,0.00033559607,0.00004799477],"genre_scores_gemma":[0.30025116,0.000011163997,0.6995114,0.00001395854,0.000105896725,0.00007571105,0.0000014384646,0.000012283048,0.000017009099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913746,0.00004528314,0.00023907126,0.00022537554,0.00013138272,0.00022140672],"domain_scores_gemma":[0.9950068,0.0040295874,0.000146297,0.00060555094,0.00017757874,0.000034176253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048794938,0.00012277033,0.00018155751,0.00006135012,0.00010102032,0.000037404006,0.0011390661,0.00006225365,5.643053e-7],"category_scores_gemma":[0.002286156,0.000089322726,0.000051017836,0.00017507342,0.00003829955,0.00033234732,0.00015095083,0.00005668092,9.595624e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061209736,0.000048184233,0.00016274121,0.0002016252,0.000102069134,0.0000016507734,0.0027682632,0.89936453,0.0052819108,0.029025845,0.00017126654,0.062810704],"study_design_scores_gemma":[0.0003337646,0.00012415026,0.0005789945,0.0000408119,0.000033962788,0.000001387497,0.00006183648,0.90445846,0.059747543,0.03437303,0.00008858813,0.00015748436],"about_ca_topic_score_codex":0.000007978028,"about_ca_topic_score_gemma":0.000005626959,"teacher_disagreement_score":0.29405195,"about_ca_system_score_codex":0.000019094703,"about_ca_system_score_gemma":0.00003790483,"threshold_uncertainty_score":0.3642475},"labels":[],"label_agreement":null},{"id":"W4240435199","doi":"10.1145/2499368.2451140","title":"Why you should care about quantile regression","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"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; Quantile regression; Quantile; Variance (accounting); Property (philosophy); Computer experiment; Regression analysis; Field (mathematics); Regression; Data mining; Statistics; Machine learning; Simulation; Mathematics","score_opus":0.023463831647667667,"score_gpt":0.26114636798421054,"score_spread":0.23768253633654288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240435199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70739937,0.020771457,0.15651952,0.06529528,0.009087925,0.00244593,0.00003106757,0.0038302178,0.03461921],"genre_scores_gemma":[0.98787516,0.000032014796,0.008067936,0.0032230176,0.00028397646,0.000042323078,0.000010363699,0.000012293397,0.0004529282],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860376,0.0000749967,0.00021559543,0.00042430856,0.00032394353,0.00035738223],"domain_scores_gemma":[0.9983207,0.00029034953,0.00011930151,0.0009771277,0.00014425271,0.00014825276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009755019,0.00018665746,0.0001935174,0.0000684751,0.00019363532,0.0003639291,0.0015969392,0.000108154236,0.00021267794],"category_scores_gemma":[0.000093528026,0.0001405534,0.00006722291,0.00020680473,0.000044396547,0.00071641704,0.00027468923,0.00018078183,0.0006146422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012586582,0.00004996872,0.0043667774,0.00004266974,0.000031044387,0.000028776152,0.002068526,0.000746337,0.00030902526,0.009847932,0.12783353,0.85466284],"study_design_scores_gemma":[0.002614294,0.00059498975,0.03141645,0.0005829304,0.000100946825,0.000035949477,0.002125421,0.3559876,0.001633867,0.0034038564,0.5996273,0.0018763399],"about_ca_topic_score_codex":0.00020424102,"about_ca_topic_score_gemma":0.000078757635,"teacher_disagreement_score":0.8527865,"about_ca_system_score_codex":0.000018168874,"about_ca_system_score_gemma":0.000037738653,"threshold_uncertainty_score":0.79001874},"labels":[],"label_agreement":null},{"id":"W4240517907","doi":"10.1145/2499368.2451157","title":"Traffic management","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Locality; Operating system; Linux kernel; Page fault; Embedded system; Virtual memory; Memory management; Overlay","score_opus":0.015768171220470858,"score_gpt":0.2423602508148654,"score_spread":0.22659207959439454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240517907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077696994,0.00021473004,0.8654793,0.0038004601,0.00044947083,0.000501128,7.5701485e-7,0.002567909,0.049289264],"genre_scores_gemma":[0.6282851,0.0000140009115,0.37070277,0.00042929949,0.000026154758,0.000017050525,0.0000018651443,0.000004264725,0.00051951455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924296,0.000031971165,0.00013573235,0.00024129274,0.00015373477,0.00019429889],"domain_scores_gemma":[0.9991126,0.00008531836,0.000057911966,0.000649601,0.000036435653,0.000058114674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010512724,0.00009271738,0.00008464562,0.00008833365,0.000089545865,0.00024653674,0.0014014738,0.00003190642,0.00005227649],"category_scores_gemma":[0.000022801674,0.000080950755,0.000028186196,0.00019788057,0.000017589191,0.00037538027,0.00032986884,0.000057948113,0.0005088128],"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.000005524331,0.00022592163,0.00091222074,0.00009567916,0.000097692675,0.00005039312,0.0015344982,0.0702313,0.00007956307,0.07050299,0.13593116,0.72033304],"study_design_scores_gemma":[0.00048351416,0.00021127399,0.0124081345,0.00006571961,0.00001658957,0.000012954932,0.00008749672,0.94678974,0.0008548484,0.011489109,0.02690705,0.0006735963],"about_ca_topic_score_codex":0.000015709478,"about_ca_topic_score_gemma":0.0000012120179,"teacher_disagreement_score":0.8765584,"about_ca_system_score_codex":0.0000104499095,"about_ca_system_score_gemma":0.0000063036227,"threshold_uncertainty_score":0.65399283},"labels":[],"label_agreement":null},{"id":"W4240790600","doi":"10.1145/1932682.1869518","title":"Refactoring references for library migration","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Code refactoring; Computer science; Programming language; Declaration; Set (abstract data type); Transformation (genetics); Source code; Feature (linguistics); Software engineering; Code (set theory); Key (lock); Program transformation; Software; Operating system","score_opus":0.03467563794292089,"score_gpt":0.28359976719964003,"score_spread":0.24892412925671914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240790600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96835864,0.000056133373,0.027418777,0.001813223,0.0012132624,0.00017226143,0.0000068688137,0.00062466494,0.00033619438],"genre_scores_gemma":[0.8524356,0.0000048895845,0.14703238,0.000039014474,0.00023150077,0.000025526462,0.000009801028,0.000009640604,0.00021164435],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991967,0.000013171612,0.00011243102,0.0002555101,0.00019455809,0.0002276085],"domain_scores_gemma":[0.99724126,0.001967512,0.00003898553,0.0006404185,0.00003433166,0.00007747288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016936955,0.000086947024,0.00008206661,0.000098957564,0.00008427863,0.00031557865,0.001430278,0.00006523854,0.000024337383],"category_scores_gemma":[0.0015145977,0.00007502603,0.000027326296,0.00018682603,0.000018229664,0.0011191409,0.0002293994,0.00018161118,0.000035648056],"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.000059596347,0.00015910128,0.52682525,0.0003915992,0.00009561923,0.0000332401,0.0045455447,0.0004668117,0.084526666,0.079061404,0.023535876,0.2802993],"study_design_scores_gemma":[0.0009177143,0.000561909,0.44840413,0.000110454304,0.000019584275,0.000016838172,0.00009900819,0.046630368,0.19156803,0.023503391,0.28699416,0.001174411],"about_ca_topic_score_codex":0.000026002026,"about_ca_topic_score_gemma":0.000048806545,"teacher_disagreement_score":0.2791249,"about_ca_system_score_codex":0.0000050329977,"about_ca_system_score_gemma":0.00004862955,"threshold_uncertainty_score":0.30594727},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","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":"W4241341782","doi":"10.1145/2499369.2465570","title":"Non-intrusive program tracing and debugging of deployed embedded systems through side-channel analysis","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Debugging; Tracing; TRACE (psycholinguistics); Software deployment; Embedded system; Scope (computer science); Side channel attack; Task (project management); Code (set theory); Cryptography; Programming language; Operating system; Computer security","score_opus":0.014983434024268756,"score_gpt":0.274744271491468,"score_spread":0.25976083746719925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241341782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24528326,0.00029579372,0.7521204,0.000121770034,0.00014922865,0.0007881081,0.0000035702312,0.00094261527,0.0002952636],"genre_scores_gemma":[0.84839,0.000017260474,0.15131705,0.000047588794,0.000033137007,0.00015925286,0.0000028374377,0.000013646207,0.00001925862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984517,0.0000701969,0.00041135846,0.00048092293,0.00026825207,0.00031756688],"domain_scores_gemma":[0.9980465,0.00047374272,0.00038291982,0.00079434976,0.00021666907,0.00008578944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110676,0.00020640803,0.00042560333,0.00027281552,0.00013131365,0.00024697479,0.00076452276,0.000092303344,0.0000047994513],"category_scores_gemma":[0.00023943491,0.00018411093,0.00008871706,0.00090312224,0.00007561873,0.0014224155,0.0003283208,0.00013833315,0.000007276447],"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.00013885272,0.0011629978,0.023892153,0.0029120883,0.0062570856,0.00024832485,0.062642604,0.0922983,0.06736417,0.007836464,0.002223448,0.7330235],"study_design_scores_gemma":[0.0006204747,0.00068105065,0.01188549,0.00026416828,0.0005516788,0.000047444257,0.0021745581,0.8438841,0.1269132,0.011888943,0.00013342377,0.0009554424],"about_ca_topic_score_codex":0.0009328061,"about_ca_topic_score_gemma":0.000074978,"teacher_disagreement_score":0.75158584,"about_ca_system_score_codex":0.000027127293,"about_ca_system_score_gemma":0.000019017372,"threshold_uncertainty_score":0.7507826},"labels":[],"label_agreement":null},{"id":"W4241344291","doi":"10.1145/996893.996861","title":"Jedd","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Compiler; Binary decision diagram; Key (lock); Java; Data structure; Theoretical computer science; Operating system","score_opus":0.045068316931145054,"score_gpt":0.2952424756677303,"score_spread":0.2501741587365853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241344291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018407207,0.00022282847,0.9785837,0.00090740406,0.00056486507,0.00005213676,9.962555e-7,0.0008563286,0.00040452267],"genre_scores_gemma":[0.2730351,0.0000071528816,0.7266675,0.00017803004,0.000055245222,0.000004377028,8.091872e-7,0.000006499722,0.000045221987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992118,0.000028657443,0.0001136573,0.0002539768,0.00015308542,0.00023883533],"domain_scores_gemma":[0.9982945,0.0007592381,0.00004560584,0.00081823475,0.000025499055,0.00005696156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002010428,0.00010881513,0.00011757483,0.00006202143,0.00006071391,0.00006796754,0.0014853085,0.00004532884,0.000004505791],"category_scores_gemma":[0.001665612,0.00009717981,0.000030201225,0.00020972698,0.00003165339,0.0004985005,0.00034963037,0.000113089336,0.00012980081],"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.000008893723,0.00006873153,0.000776863,0.000058324018,0.00004201835,0.00019793467,0.0025174397,0.7435614,0.0040702894,0.16277419,0.00041230582,0.08551164],"study_design_scores_gemma":[0.0014185878,0.00037636166,0.019073091,0.00011668892,0.000021865317,0.00008998411,0.00014958548,0.0015411527,0.061257485,0.8992803,0.015377434,0.0012974258],"about_ca_topic_score_codex":0.000014777152,"about_ca_topic_score_gemma":0.00000491243,"teacher_disagreement_score":0.74202025,"about_ca_system_score_codex":0.000031338048,"about_ca_system_score_gemma":0.000028525285,"threshold_uncertainty_score":0.39628777},"labels":[],"label_agreement":null},{"id":"W4241907611","doi":"10.1145/2480359.2429075","title":"Copatterns","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Coinduction; Programming language; Soundness; Haskell; Functional programming; Data type; Data structure; Theoretical computer science; Pattern matching; Type (biology); Matching (statistics); Semantics (computer science); Sketch; Algorithm; Mathematical proof; Mathematics","score_opus":0.028932060535086145,"score_gpt":0.2500366596544939,"score_spread":0.22110459911940775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241907611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49281052,0.0012186625,0.38826925,0.00914439,0.00632098,0.001613031,0.0000032924686,0.002150624,0.09846925],"genre_scores_gemma":[0.9943276,0.0000027342494,0.0040395153,0.00052808475,0.0001724292,0.00002618938,0.0000028556929,0.0000062879435,0.00089430634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990752,0.00004449555,0.00015143254,0.00026369063,0.000192267,0.00027293857],"domain_scores_gemma":[0.9988708,0.0001458555,0.00008325271,0.0007554315,0.0000520729,0.00009261368],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013422362,0.0001070515,0.00012227819,0.000045401135,0.000084092004,0.00038995207,0.0014444084,0.000050273713,0.00014838003],"category_scores_gemma":[0.00007281418,0.00008095106,0.00003703805,0.00012675601,0.000027187732,0.0005493429,0.00029109564,0.000076942335,0.0033018528],"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.0000047630683,0.00025287594,0.1992261,0.0001906014,0.000106826556,0.00012809424,0.0065072696,0.00006065556,0.0016022543,0.4327215,0.06499825,0.29420084],"study_design_scores_gemma":[0.0021436238,0.0011515061,0.2760732,0.000043378837,0.000059218513,0.00017216065,0.0009448679,0.031157088,0.007035013,0.1864939,0.4921715,0.002554555],"about_ca_topic_score_codex":0.0007310862,"about_ca_topic_score_gemma":0.000051985113,"teacher_disagreement_score":0.50151706,"about_ca_system_score_codex":0.000010729842,"about_ca_system_score_gemma":0.000017072316,"threshold_uncertainty_score":0.9974742},"labels":[],"label_agreement":null},{"id":"W4241934337","doi":"10.1145/2345141.1967692","title":"Lowering overhead in sampling-based execution monitoring and tracing","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Debugging; Computer science; Tracing; Overhead (engineering); Algorithmic program debugging; Embedded system; Software; Resource (disambiguation); Real-time computing; Operating system; Distributed computing","score_opus":0.037623521825516815,"score_gpt":0.29390926154239394,"score_spread":0.2562857397168771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241934337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751621,0.00063709426,0.02296077,0.00009556808,0.00083750236,0.00009692192,5.9389305e-7,0.00011535086,0.000094118266],"genre_scores_gemma":[0.9885037,0.00000823389,0.011274552,0.000020547956,0.00017475146,0.000008493674,7.680339e-7,0.000005266528,0.000003689768],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990865,0.000029282335,0.00019548251,0.00021254437,0.0001640129,0.00031215232],"domain_scores_gemma":[0.99909556,0.00033917444,0.000065946224,0.0004021892,0.000018696554,0.00007845222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055596733,0.000106036525,0.00013253701,0.000093772884,0.00009362898,0.00008623864,0.00032772397,0.00006593851,0.0000018872163],"category_scores_gemma":[0.00016401292,0.000093108734,0.000022285403,0.00018600737,0.000021807758,0.00097593333,0.000116860436,0.00011792668,0.0000119373935],"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.000006993146,0.00003616667,0.98374337,0.000113190006,0.0000031199206,0.0000017555844,0.0016178017,0.0010802601,0.0007991105,0.000047618927,0.0000037963082,0.0125468],"study_design_scores_gemma":[0.00034693166,0.000044413468,0.9808242,0.00027012607,0.0000053821313,0.0000061081896,0.00014342726,0.007794508,0.010057395,0.000102083875,0.00018161729,0.00022381305],"about_ca_topic_score_codex":0.00012638854,"about_ca_topic_score_gemma":0.000011124222,"teacher_disagreement_score":0.013341618,"about_ca_system_score_codex":0.000049246675,"about_ca_system_score_gemma":0.00001979569,"threshold_uncertainty_score":0.37968642},"labels":[],"label_agreement":null},{"id":"W4242116028","doi":"10.1145/3140587.3062346","title":"Miniphases: compilation using modular and efficient tree transformations","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Compiler; Tree traversal; Programming language; Modular design; Just-in-time compilation; Intermediate language; Optimizing compiler; Parallel computing; Cache; Modularity (biology); Compiler correctness; Dynamic compilation","score_opus":0.046258631912153465,"score_gpt":0.3064293902375374,"score_spread":0.26017075832538394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242116028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2148258,0.00009176708,0.78314155,0.0003993431,0.00010120661,0.000104963474,0.000004981601,0.00017121944,0.0011591432],"genre_scores_gemma":[0.7546414,0.000008961494,0.24524945,0.000053036965,0.000024643055,0.000001897844,0.000004926086,0.0000035941187,0.0000120790755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930197,0.00003368376,0.00016787503,0.00020558342,0.000146718,0.0001441961],"domain_scores_gemma":[0.99891335,0.00009513472,0.00016193942,0.000720336,0.000052725896,0.000056538087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019383803,0.00009708283,0.000111690824,0.00008752374,0.0007387621,0.0005321803,0.00088599866,0.000042889395,0.0000030310596],"category_scores_gemma":[0.000096749456,0.00009110309,0.000025994208,0.000059014274,0.00006072341,0.0005323573,0.0001745,0.00005834869,0.0000056912154],"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.00002445288,0.0002675147,0.009320728,0.00011607709,0.00006926017,0.000024003872,0.0071664657,0.82388383,0.00394838,0.027078526,0.00062944775,0.12747131],"study_design_scores_gemma":[0.00021965471,0.000029506702,0.005702491,0.000030962667,0.000009409106,0.0000067037004,0.000015727546,0.9912035,0.0017101262,0.00068746624,0.00025992675,0.00012453365],"about_ca_topic_score_codex":0.000036362937,"about_ca_topic_score_gemma":0.000007774795,"teacher_disagreement_score":0.5398156,"about_ca_system_score_codex":0.000012948092,"about_ca_system_score_gemma":0.000020601079,"threshold_uncertainty_score":0.56820357},"labels":[],"label_agreement":null},{"id":"W4242224286","doi":"10.1145/2398857.2384678","title":"Exploiting inter-sequence correlations for program behavior prediction","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"National Science Foundation","keywords":"Computer science; Scope (computer science); Locality; Speedup; Sequence (biology); Program analysis; Machine learning; Artificial intelligence; Programming language; Parallel computing","score_opus":0.07910759505903991,"score_gpt":0.3395400838164095,"score_spread":0.2604324887573696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242224286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026857216,0.000084198924,0.9694295,0.00020702474,0.000626762,0.00057963014,0.000012181833,0.0015059499,0.0006975534],"genre_scores_gemma":[0.5876165,0.0000032016544,0.41186294,0.000056499564,0.00013067656,0.00023703618,0.000026664986,0.0000066268926,0.000059836737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906737,0.00004058879,0.00023232025,0.00022199973,0.00013233912,0.0003054024],"domain_scores_gemma":[0.9989283,0.00029242988,0.00014826727,0.00044164612,0.00009912405,0.000090199654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003143538,0.00011184989,0.00010293951,0.00009114393,0.00022870861,0.00015959232,0.00071312254,0.00006594624,0.000005144532],"category_scores_gemma":[0.00030553824,0.00010784603,0.00004909427,0.0001951992,0.000030623047,0.0010065736,0.00018334504,0.00009765762,0.00001668001],"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.000021447702,0.0011703137,0.20815276,0.00010861497,0.000058099915,0.0000049615956,0.00657431,0.0046536266,0.0011525813,0.042574815,0.009739189,0.7257893],"study_design_scores_gemma":[0.0006452616,0.0007036927,0.028501453,0.00017632717,0.00009478538,0.000048717888,0.00022066767,0.9399608,0.004855282,0.0020422037,0.022028103,0.000722732],"about_ca_topic_score_codex":0.000012165814,"about_ca_topic_score_gemma":0.0000018243654,"teacher_disagreement_score":0.93530715,"about_ca_system_score_codex":0.000030659543,"about_ca_system_score_gemma":0.000021748996,"threshold_uncertainty_score":0.43978333},"labels":[],"label_agreement":null},{"id":"W4242946001","doi":"10.1145/1103845.1094852","title":"X10","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":293,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Uniprocessor system; Computer science; Scalability; Synchronization (alternating current); Programming paradigm; Multiprocessing; Partitioned global address space; Distributed computing; Construct (python library); Node (physics); Parallel computing; Programming language; Operating system; Telecommunications","score_opus":0.01662160194682793,"score_gpt":0.2513658921889296,"score_spread":0.23474429024210164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242946001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40744546,0.003731313,0.40044937,0.036874436,0.003659339,0.0006894187,0.00009669714,0.0020939584,0.14496002],"genre_scores_gemma":[0.9756184,0.0000046093614,0.022693364,0.00066520745,0.00026851112,0.0000056358003,0.0000049814143,0.0000046344094,0.0007346156],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999119,0.00002512444,0.00016741836,0.00025428427,0.00019914753,0.00023505553],"domain_scores_gemma":[0.9989304,0.00010161812,0.00007067953,0.0007806229,0.000036233043,0.00008047585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015160738,0.00009712558,0.00011800322,0.000035091743,0.000084077175,0.00018889726,0.0014522698,0.00004420535,0.000036344874],"category_scores_gemma":[0.00006850418,0.000082571554,0.000036320114,0.00017708752,0.000018984523,0.00059230265,0.00018740592,0.000079111596,0.00084288296],"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.000016699638,0.0003075145,0.008827047,0.00008130776,0.00008021457,0.00011335548,0.0031953978,0.0028786631,0.002169182,0.20912631,0.13024294,0.6429614],"study_design_scores_gemma":[0.00041583856,0.00005572742,0.010038769,0.000038095972,0.0000061278683,0.000024463665,0.000043124008,0.03666357,0.0015726216,0.00089945534,0.94990015,0.00034205828],"about_ca_topic_score_codex":0.000034447286,"about_ca_topic_score_gemma":0.000043973552,"teacher_disagreement_score":0.8196572,"about_ca_system_score_codex":0.000015897622,"about_ca_system_score_gemma":0.000021446474,"threshold_uncertainty_score":0.9999351},"labels":[],"label_agreement":null},{"id":"W4243331590","doi":"10.1145/1755951.1755908","title":"Sampling-based program execution monitoring","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Debugging; Computer science; Tracing; Heuristics; Overhead (engineering); Algorithmic program debugging; Sampling (signal processing); Instrumentation (computer programming); Control flow; Real-time computing; Embedded system; Distributed computing; Programming language; Operating system","score_opus":0.028855335401968368,"score_gpt":0.31082155791447225,"score_spread":0.28196622251250386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243331590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98031574,0.000041813168,0.014889669,0.0004294696,0.002934239,0.000281235,0.0000014453806,0.0007920008,0.00031439358],"genre_scores_gemma":[0.8755406,0.0000012047303,0.12403152,0.00003369242,0.00032288692,0.000044116114,0.00000320942,0.000006326631,0.000016419102],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988897,0.000027130403,0.00020083113,0.0003353095,0.00026787794,0.00027914156],"domain_scores_gemma":[0.9983833,0.0002733848,0.00009784883,0.0010642246,0.00008971148,0.00009155807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038683438,0.00012776913,0.00012745833,0.000068434965,0.00018128398,0.0002167015,0.0011672532,0.00011107096,0.000009081748],"category_scores_gemma":[0.00028963262,0.00010203106,0.00005434092,0.00024563546,0.000050169143,0.00047620517,0.00014959455,0.0002437014,0.00010859716],"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.000016805958,0.00026927673,0.6197152,0.0001447763,0.000018987494,0.000009306893,0.0006459911,0.00068552303,0.0051352214,0.00073718844,0.00021122355,0.3724105],"study_design_scores_gemma":[0.0010207612,0.00054011657,0.8531657,0.00018588507,0.000029685103,0.00001795938,0.00009146842,0.05591358,0.049386058,0.0014000376,0.037332945,0.0009158026],"about_ca_topic_score_codex":0.000066629145,"about_ca_topic_score_gemma":0.000020413041,"teacher_disagreement_score":0.37149468,"about_ca_system_score_codex":0.000016941696,"about_ca_system_score_gemma":0.00006652717,"threshold_uncertainty_score":0.41607058},"labels":[],"label_agreement":null},{"id":"W4243774012","doi":"10.1145/2666357.2597823","title":"em-SPADE","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Compiler; Programming language; Preprocessor; Software; Parallel computing","score_opus":0.01955025228379702,"score_gpt":0.2625397247484502,"score_spread":0.2429894724646532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243774012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42360258,0.00018188963,0.56961465,0.0021178299,0.0010025584,0.0001419727,0.0000018445542,0.0012159802,0.0021206895],"genre_scores_gemma":[0.9489403,0.0000021133342,0.05043512,0.00020528321,0.00015451963,0.0000066956195,0.0000014832859,0.000009594888,0.0002449073],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989605,0.00004310726,0.000101287995,0.0002698086,0.0003199109,0.0003054081],"domain_scores_gemma":[0.9967679,0.0020025251,0.000027940414,0.0010541796,0.0000373452,0.000110154164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035592288,0.000093384806,0.00009958311,0.00009488678,0.000061854684,0.00019958259,0.0020594047,0.000044624674,0.000027282014],"category_scores_gemma":[0.003013444,0.00008382916,0.000027331018,0.00024538566,0.000019845636,0.00029565854,0.00045554276,0.00014072254,0.0006037949],"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.000029724622,0.00030840444,0.18145429,0.0004062058,0.00017763463,0.00019901161,0.009257936,0.014606845,0.005555191,0.1246596,0.060058482,0.6032867],"study_design_scores_gemma":[0.0011670162,0.00053987134,0.56411386,0.000118808086,0.000017700686,0.000047040725,0.00008121644,0.24383952,0.011952052,0.010999083,0.16584852,0.0012753333],"about_ca_topic_score_codex":0.00002335414,"about_ca_topic_score_gemma":0.00001003659,"teacher_disagreement_score":0.6020114,"about_ca_system_score_codex":0.000015726248,"about_ca_system_score_gemma":0.00001996846,"threshold_uncertainty_score":0.7760763},"labels":[],"label_agreement":null},{"id":"W4243778460","doi":"10.1145/2775054.2694394","title":"Dual Execution for On the Fly Fine Grained Execution Comparison","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","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":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Computer science; Debugging; Programming language; Distributed computing","score_opus":0.13166431278598673,"score_gpt":0.32846661103871233,"score_spread":0.1968022982527256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243778460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21115905,0.00025492546,0.750595,0.020132609,0.0015457283,0.0011033585,0.000025090587,0.0126746325,0.002509658],"genre_scores_gemma":[0.9101549,6.2485316e-7,0.08891773,0.0005759532,0.00017557624,0.000058711616,0.00002184598,0.000009402792,0.00008524777],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988507,0.00008906463,0.00020872749,0.00030565698,0.00029843455,0.0002474005],"domain_scores_gemma":[0.9969852,0.0018393238,0.00015349411,0.00080231385,0.00013928008,0.00008037899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082873815,0.00014605711,0.00015465227,0.00007737436,0.0001985598,0.00018384484,0.0009173615,0.000068262656,0.0000019987692],"category_scores_gemma":[0.003230011,0.00010055397,0.000048492046,0.00021705242,0.000049421622,0.00021364867,0.00018182409,0.00012298467,0.000031594467],"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.00013013808,0.00023300282,0.004152354,0.000033149914,0.000032177308,0.0000106267435,0.0033777256,0.0005880873,0.00031324718,0.08278324,0.86892307,0.03942316],"study_design_scores_gemma":[0.0020956574,0.0036926176,0.009190445,0.0003328668,0.000083249,0.000047862908,0.00023933884,0.47520882,0.01649473,0.44269553,0.048749458,0.0011694285],"about_ca_topic_score_codex":0.000098947385,"about_ca_topic_score_gemma":0.000020722771,"teacher_disagreement_score":0.8201736,"about_ca_system_score_codex":0.000042735464,"about_ca_system_score_gemma":0.0000508453,"threshold_uncertainty_score":0.41004717},"labels":[],"label_agreement":null},{"id":"W4244697326","doi":"10.1145/2499368.2451118","title":"GPUDet","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Debugging; Parallel computing; Scalability; Nondeterministic algorithm; Thread (computing); Compiler; Multi-core processor; Massively parallel; Correctness; Execution model; Programming language; Operating system; Theoretical computer science","score_opus":0.01849169908033233,"score_gpt":0.2516386902440366,"score_spread":0.2331469911637043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244697326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036729418,0.0001638356,0.92969024,0.004371859,0.00034938718,0.00023009011,9.3133957e-7,0.0017610472,0.026703212],"genre_scores_gemma":[0.6444608,0.0000067351893,0.35431144,0.00071906915,0.000047607948,0.000010900117,0.0000020994873,0.00000448683,0.00043684486],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.000037605227,0.0001328307,0.00022075561,0.00014231779,0.0001898002],"domain_scores_gemma":[0.9989524,0.00017086955,0.00006621732,0.0006805649,0.00006365166,0.00006631969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011014718,0.0000882877,0.000090932605,0.00006763967,0.00009000626,0.00026818283,0.0014640337,0.000042055326,0.00007870924],"category_scores_gemma":[0.00012604594,0.0000754882,0.000026849471,0.0001803832,0.000021094733,0.0005161095,0.00033682917,0.00007301572,0.00064521265],"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.0000068783206,0.00031486325,0.019136595,0.00008085817,0.0000924284,0.000043573502,0.0036759523,0.014383029,0.0022840751,0.12816386,0.5021743,0.32964358],"study_design_scores_gemma":[0.00056937855,0.00028976635,0.03456842,0.00007242014,0.000012539129,0.000029198276,0.000062796724,0.8397866,0.01222455,0.06370451,0.047620736,0.0010590848],"about_ca_topic_score_codex":0.000094111194,"about_ca_topic_score_gemma":0.0000024411886,"teacher_disagreement_score":0.8254036,"about_ca_system_score_codex":0.000008445488,"about_ca_system_score_gemma":0.000016619646,"threshold_uncertainty_score":0.82931185},"labels":[],"label_agreement":null},{"id":"W4244955996","doi":"10.1145/3393934.3278127","title":"Exploring feature interactions without specifications: a controlled experiment","year":2020,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"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; Feature (linguistics); Graph; Control flow; Control flow graph; Data mining; Feature model; Information flow; Machine learning; Artificial intelligence; Theoretical computer science; Human–computer interaction; Programming language; Software","score_opus":0.22279030538800812,"score_gpt":0.3249284050983488,"score_spread":0.10213809971034069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244955996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5047753,0.002163484,0.39975715,0.08198521,0.0028667226,0.0019697011,0.000014966709,0.0035199155,0.002947589],"genre_scores_gemma":[0.94675857,0.000024001714,0.052260112,0.0002701521,0.0002990227,0.00022884624,0.0000037176756,0.00001433453,0.00014126852],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883556,0.000049084396,0.0001683658,0.00037210484,0.00032671992,0.00024817584],"domain_scores_gemma":[0.99769217,0.001276966,0.00006149905,0.00071650295,0.000071554256,0.0001813287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001240357,0.00013712746,0.00020726031,0.00009695657,0.00011021463,0.00027532564,0.0013358251,0.00002501267,0.000041840114],"category_scores_gemma":[0.0020802494,0.00012124961,0.00006176983,0.00037323014,0.000020743702,0.000856152,0.00032559742,0.0002543034,0.00026458438],"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.0025590474,0.0019922797,0.09972316,0.0008468121,0.0027321216,0.000947179,0.22188568,0.033149257,0.27132675,0.09370662,0.12817627,0.14295483],"study_design_scores_gemma":[0.018253097,0.0013262653,0.09480856,0.0005412193,0.00015048492,0.000093518516,0.006124581,0.3388117,0.13275312,0.0006460501,0.40317634,0.0033150595],"about_ca_topic_score_codex":0.0000116390665,"about_ca_topic_score_gemma":0.0000027432968,"teacher_disagreement_score":0.44198328,"about_ca_system_score_codex":0.000045233708,"about_ca_system_score_gemma":0.000038126127,"threshold_uncertainty_score":0.49444157},"labels":[],"label_agreement":null},{"id":"W4245755273","doi":"10.1145/3263322","title":"Session details: Optimization","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Session (web analytics); Programming language; World Wide Web","score_opus":0.028576190589446028,"score_gpt":0.28137966886513127,"score_spread":0.2528034782756852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245755273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036471733,0.0004082692,0.98996097,0.00044546468,0.00036554405,0.0000854098,6.5154137e-7,0.00076416373,0.0043223375],"genre_scores_gemma":[0.4874313,0.000026819323,0.5120837,0.00025262762,0.000095436284,0.000004246919,0.0000064216333,0.000005836586,0.0000936337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00008157604,0.00017158398,0.00019541034,0.00019189114,0.00028447967],"domain_scores_gemma":[0.99894404,0.00017690232,0.0001172636,0.0005968797,0.000057663972,0.000107255975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032142483,0.000113276925,0.00010750449,0.000098505145,0.0001546754,0.00009643467,0.0009386323,0.00006810044,0.00003230665],"category_scores_gemma":[0.0002052365,0.00009832592,0.000031529544,0.00027258904,0.000018351062,0.0010771201,0.00032414382,0.00008458179,0.00007176923],"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.000019566916,0.0004395451,0.04435932,0.00007152065,0.000052215895,0.000009639742,0.0038211155,0.8187848,0.0005323477,0.02727581,0.030473847,0.07416031],"study_design_scores_gemma":[0.00021609213,0.000057967543,0.0029489584,0.000042876713,0.000011651317,0.000012776768,0.000031735693,0.98388624,0.004973164,0.0006502284,0.006811809,0.00035649908],"about_ca_topic_score_codex":0.000010068596,"about_ca_topic_score_gemma":6.4149174e-7,"teacher_disagreement_score":0.4837841,"about_ca_system_score_codex":0.000019080135,"about_ca_system_score_gemma":0.000019224659,"threshold_uncertainty_score":0.4009615},"labels":[],"label_agreement":null},{"id":"W4245783794","doi":"10.1145/1961296.1950391","title":"Flikker","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"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; Dram; Embedded system; Correctness; Energy consumption; Software; Operating system; Computer hardware; Programming language","score_opus":0.051716058342789854,"score_gpt":0.25963449058543114,"score_spread":0.20791843224264128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245783794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012350431,0.000117877775,0.91426533,0.00033171676,0.0003212281,0.000087487155,8.509844e-7,0.0012722572,0.07125284],"genre_scores_gemma":[0.5552609,0.0000058459427,0.4440716,0.00035619253,0.000029006047,0.000003007688,0.0000010684859,0.0000040980785,0.00026829058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993258,0.000035358287,0.00012543969,0.00022134585,0.000119927194,0.0001721235],"domain_scores_gemma":[0.9990692,0.00007854024,0.000066294764,0.0006868664,0.000042717093,0.00005634948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015164979,0.000085680746,0.00008578247,0.00006887743,0.0000808434,0.00006886499,0.0014298381,0.000042457454,0.000048024245],"category_scores_gemma":[0.00008956739,0.00007433014,0.000028889328,0.00016941909,0.000023908178,0.00031330402,0.00031807623,0.00006903036,0.00017220908],"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.000055475455,0.00071066176,0.044032615,0.00009406472,0.00016879287,0.00025853777,0.026599517,0.0020180254,0.0008209073,0.6213903,0.09462969,0.20922144],"study_design_scores_gemma":[0.001714896,0.0011678985,0.106629625,0.0002000925,0.00006708239,0.000118132455,0.00022443027,0.5536787,0.08609016,0.15305416,0.09395666,0.003098173],"about_ca_topic_score_codex":0.00004742466,"about_ca_topic_score_gemma":0.0000036336103,"teacher_disagreement_score":0.55166066,"about_ca_system_score_codex":0.000006546,"about_ca_system_score_gemma":0.000017398905,"threshold_uncertainty_score":0.30310953},"labels":[],"label_agreement":null},{"id":"W4245984267","doi":"10.1145/2714064.2660204","title":"Cybertron","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Granularity; Reduction (mathematics); Encoding (memory); Computation; Parallel computing; Focus (optics); Big data; State (computer science); Algorithm; Programming language; Operating system","score_opus":0.015045178171347663,"score_gpt":0.25070451830976737,"score_spread":0.23565934013841972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245984267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008429764,0.000048489128,0.965829,0.0013393961,0.00021087566,0.000051571355,3.3314464e-7,0.0008524427,0.023238106],"genre_scores_gemma":[0.6915543,0.0000037643765,0.30752096,0.00057989743,0.000071028364,0.0000026045213,0.0000020559567,0.0000043399973,0.0002610306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992682,0.00006461727,0.00012137922,0.00022959556,0.0001409686,0.00017527517],"domain_scores_gemma":[0.99887943,0.00025235975,0.00006876973,0.0007081225,0.00003621809,0.000055095337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024595083,0.000085383545,0.000096325835,0.00006328962,0.00009601322,0.00013793785,0.0012952097,0.00004056477,0.000009879074],"category_scores_gemma":[0.00024014474,0.000075174474,0.00002752155,0.00014801644,0.00001894719,0.00023938545,0.00027398596,0.00007009981,0.00012064407],"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.00001584077,0.0002046828,0.01115827,0.000060713697,0.00005200414,0.000016429109,0.0021537747,0.02931477,0.0010376874,0.50295204,0.07320924,0.37982452],"study_design_scores_gemma":[0.00038719355,0.00024190036,0.007550907,0.000041487747,0.000009150876,0.000011372357,0.000009692021,0.8476736,0.006696423,0.025858758,0.11099599,0.00052351935],"about_ca_topic_score_codex":0.000025158255,"about_ca_topic_score_gemma":0.000004333845,"teacher_disagreement_score":0.81835884,"about_ca_system_score_codex":0.000008276915,"about_ca_system_score_gemma":0.000011710998,"threshold_uncertainty_score":0.30655262},"labels":[],"label_agreement":null},{"id":"W4246313780","doi":"10.1145/2544174.2500603","title":"Calculating threesomes, with blame","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","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":"University of British Columbia","funders":"","keywords":"Blame; Computer science; Coercion (linguistics); Subtyping; Construct (python library); Semantics (computer science); Computer security; Programming language; Theoretical computer science; Algorithm; Psychology; Social psychology; Linguistics","score_opus":0.02240270719704156,"score_gpt":0.2353946206387432,"score_spread":0.21299191344170162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246313780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5695023,0.0012596028,0.36456016,0.004009301,0.0015041278,0.0015847635,0.0000015633422,0.0017142979,0.0558639],"genre_scores_gemma":[0.9791216,0.0000014234637,0.019990543,0.00025514772,0.00013992202,0.00002718837,0.000002906071,0.000009808485,0.0004514611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988259,0.00004334437,0.00017069744,0.0003271452,0.0002947179,0.00033820482],"domain_scores_gemma":[0.9987535,0.00017874678,0.00012652185,0.0007674832,0.00007264091,0.000101136124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017466089,0.00014305073,0.000162609,0.00005131501,0.00013263572,0.0004825078,0.0012409607,0.000056364865,0.000049910806],"category_scores_gemma":[0.00007198138,0.000094010415,0.00003231141,0.00021690181,0.00004665657,0.000649159,0.00026094983,0.00010442831,0.00059625634],"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.000011584775,0.00020174791,0.22744288,0.00021081294,0.00020704375,0.0001792827,0.007413785,0.0005651091,0.0012969669,0.53661394,0.005569103,0.22028776],"study_design_scores_gemma":[0.0053987396,0.0035867158,0.43510282,0.00019691157,0.00018427485,0.0005456069,0.0030048126,0.1749995,0.006000975,0.203192,0.16246372,0.005323931],"about_ca_topic_score_codex":0.0009408037,"about_ca_topic_score_gemma":0.00014840184,"teacher_disagreement_score":0.4096193,"about_ca_system_score_codex":0.000014601061,"about_ca_system_score_gemma":0.000030695457,"threshold_uncertainty_score":0.7663868},"labels":[],"label_agreement":null},{"id":"W4247047556","doi":"10.1145/2345156.2254091","title":"Parallelizing top-down interprocedural analyses","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"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; Reachability; Scalability; Call graph; Graph; Modular design; Context (archaeology); Parallelism (grammar); Programming language; Top-down and bottom-up design; Static analysis; Theoretical computer science; Parallel computing; Database","score_opus":0.08809835399604228,"score_gpt":0.36376495046101753,"score_spread":0.27566659646497527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247047556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54186845,0.0035512773,0.41313732,0.002990159,0.0017665257,0.0003070557,0.0000049340874,0.027932314,0.008441951],"genre_scores_gemma":[0.78314054,0.0000044103213,0.21598691,0.00062307675,0.00016981889,0.000009423632,0.0000026450205,0.000008010984,0.000055171753],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988362,0.000052073046,0.00020237896,0.0002589495,0.00021586324,0.00043449242],"domain_scores_gemma":[0.9981892,0.00069701474,0.000112009344,0.0008191588,0.000047046906,0.00013558663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031626233,0.00015998188,0.00017327482,0.0001284529,0.00012969547,0.00019291647,0.0014321749,0.000058648133,0.00001869301],"category_scores_gemma":[0.0011861268,0.00013078377,0.00006314043,0.00028757678,0.00003737568,0.00086129305,0.00050719344,0.00013587029,0.00010849191],"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.00002015271,0.00032562437,0.6872506,0.00014515995,0.00015081996,0.00005200686,0.009297018,0.00013745356,0.0024059692,0.009367354,0.10844045,0.18240741],"study_design_scores_gemma":[0.0024970893,0.0016474469,0.5251513,0.0018018454,0.00049618236,0.0010562253,0.000773296,0.12933548,0.10145043,0.17087734,0.057332657,0.0075806906],"about_ca_topic_score_codex":0.000163613,"about_ca_topic_score_gemma":0.0000058659316,"teacher_disagreement_score":0.24127206,"about_ca_system_score_codex":0.000023247687,"about_ca_system_score_gemma":0.000025223902,"threshold_uncertainty_score":0.5333207},"labels":[],"label_agreement":null},{"id":"W4247063686","doi":"10.1145/2499369.2465563","title":"FTL <sup>2</sup>","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Flash file system; Cache; Garbage collection; Operating system; Overhead (engineering); Flash memory; NAND gate; Parallel computing; Flash (photography); Flash memory emulator; Embedded system; Garbage; Computer memory; Programming language; Algorithm; Logic gate","score_opus":0.02028831787280234,"score_gpt":0.24756213025185214,"score_spread":0.2272738123790498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247063686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5376275,0.0010896745,0.4277309,0.014688354,0.00068250025,0.0009192795,0.000039334824,0.0063559357,0.010866516],"genre_scores_gemma":[0.7227668,0.000015727235,0.27627504,0.0005488323,0.000057079873,0.00003698692,0.000009110759,0.000011226176,0.00027919209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986353,0.000029434585,0.00019840675,0.0004686979,0.0002586447,0.00040952524],"domain_scores_gemma":[0.9972178,0.00040353002,0.000103728526,0.0021309527,0.000063553736,0.00008048138],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010365686,0.00017997989,0.00017402624,0.00012553377,0.00012499504,0.00026917638,0.003944657,0.00009751092,0.00012252406],"category_scores_gemma":[0.00074196263,0.00015226862,0.00003606659,0.0003522214,0.000113746195,0.002200316,0.0015460651,0.00019715323,0.0025461307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008868863,0.00020017414,0.007965834,0.00009216561,0.000098095545,0.0002152428,0.002778883,0.006118585,0.0031046392,0.15636626,0.1138471,0.70920414],"study_design_scores_gemma":[0.001774581,0.00080717134,0.019900823,0.00016275412,0.000053526892,0.00015221798,0.0025569894,0.2792619,0.027501825,0.41150096,0.25324795,0.003079299],"about_ca_topic_score_codex":0.00010195261,"about_ca_topic_score_gemma":0.000007213397,"teacher_disagreement_score":0.70612484,"about_ca_system_score_codex":0.000029439565,"about_ca_system_score_gemma":0.000022974953,"threshold_uncertainty_score":0.9982305},"labels":[],"label_agreement":null},{"id":"W4247329450","doi":"10.1145/2544173.2509525","title":"Multiverse","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada Excellence Research Chairs, Government of Canada; Georgia Institute of Technology; National Science Foundation","keywords":"Computer science; Scalability; Speculative execution; Speculative multithreading; Task parallelism; Speculation; Implicit parallelism; Parallel computing; Commit; Exploit; Programming paradigm; Instruction-level parallelism; Parallelism (grammar); Semantics (computer science); Programming language; Multithreading; Thread (computing); Operating system","score_opus":0.019980055376845447,"score_gpt":0.2529514713999429,"score_spread":0.23297141602309746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247329450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051426847,0.00009137607,0.92621815,0.0022428078,0.00031330815,0.00025120546,0.0000010983237,0.0015580959,0.017897112],"genre_scores_gemma":[0.6214615,0.0000050160907,0.37771088,0.00041373886,0.000029686678,0.0000077591885,0.0000015472326,0.0000034394945,0.0003664454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935436,0.00003690568,0.00010943852,0.00020961439,0.000121657795,0.00016801772],"domain_scores_gemma":[0.9990873,0.00016643947,0.00006165249,0.0005544063,0.00006877582,0.000061470455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008710967,0.00008212903,0.000080663944,0.00006548393,0.0000896212,0.00018033193,0.00117179,0.000037697348,0.000070256785],"category_scores_gemma":[0.00013176374,0.0000710565,0.000026208076,0.00015560107,0.00002345145,0.0005462985,0.00031115854,0.00006669468,0.00068610953],"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.000013625744,0.00052499905,0.030064242,0.0000904378,0.0001402652,0.00008144754,0.008553207,0.027762832,0.004118767,0.10110545,0.35089362,0.4766511],"study_design_scores_gemma":[0.0005101663,0.00015431868,0.026374903,0.00004046343,0.000008116552,0.000011005474,0.00009288045,0.93207425,0.007359986,0.012722259,0.02003249,0.0006191818],"about_ca_topic_score_codex":0.00013434321,"about_ca_topic_score_gemma":0.0000024713627,"teacher_disagreement_score":0.9043114,"about_ca_system_score_codex":0.000009739213,"about_ca_system_score_gemma":0.000013764581,"threshold_uncertainty_score":0.88187784},"labels":[],"label_agreement":null},{"id":"W4248079095","doi":"10.1145/3393673.3276951","title":"HorseIR: bringing array programming languages together with database query processing","year":2020,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Relational database management system; Compiler; SQL; Database; Programming language; Parallel computing; Relational database; Query plan; Optimizing compiler; Sargable; Information retrieval; Web search query; Search engine","score_opus":0.023832372065614782,"score_gpt":0.2653052282002212,"score_spread":0.2414728561346064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248079095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043559458,0.0013270323,0.95104325,0.0019240961,0.00009437096,0.00030290746,0.00003252952,0.00072633516,0.0009900382],"genre_scores_gemma":[0.54744107,0.0000048452034,0.4516024,0.0005931886,0.00023096116,0.000019663885,0.000030702042,0.000022426453,0.000054735316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845284,0.000048504517,0.0002131922,0.00055233226,0.0003463059,0.00038680964],"domain_scores_gemma":[0.99879587,0.00011748482,0.00017499413,0.0006785308,0.00006327239,0.00016987405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018877594,0.0002168054,0.00022708239,0.00005311692,0.00020324379,0.00023795181,0.0007762453,0.00003947999,0.000011226817],"category_scores_gemma":[0.00020668466,0.00016427154,0.000030433644,0.00037644224,0.00006344849,0.0018153974,0.00031892562,0.00019740882,0.0000337233],"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.0002787317,0.00028899516,0.038081996,0.0036686219,0.00028435714,0.0028347564,0.052726325,0.0020334315,0.064551115,0.026611581,0.0020985764,0.8065415],"study_design_scores_gemma":[0.0028798326,0.0012717736,0.0031744335,0.0034757166,0.00018504813,0.00045811245,0.0208037,0.034652825,0.09702098,0.0001423102,0.831591,0.0043442594],"about_ca_topic_score_codex":0.0001698386,"about_ca_topic_score_gemma":0.00012922568,"teacher_disagreement_score":0.82949245,"about_ca_system_score_codex":0.00001371898,"about_ca_system_score_gemma":0.000074712596,"threshold_uncertainty_score":0.6698799},"labels":[],"label_agreement":null},{"id":"W4248424962","doi":"10.1145/354222.353174","title":"Object-oriented real-time concurrency","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Concurrency; Distributed computing; Scheduling (production processes); Extensibility; Predictability; Priority inheritance; Concurrent object-oriented programming; Programming language; Dynamic priority scheduling; Operating system; Programming paradigm; Reactive programming; Rate-monotonic scheduling; Inductive programming","score_opus":0.012861763121817667,"score_gpt":0.2500457315601948,"score_spread":0.2371839684383771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248424962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84386593,0.00032926718,0.0032779914,0.00070778,0.0010509263,0.00051146315,0.000014917015,0.0012277837,0.14901394],"genre_scores_gemma":[0.95560074,0.000054215052,0.039525148,0.00015401929,0.00034207417,0.000023739634,0.000023722645,0.000028886627,0.0042474447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756926,0.00019057222,0.00047385195,0.0006874102,0.0005079947,0.00057089375],"domain_scores_gemma":[0.99731976,0.00052866415,0.00018190467,0.0016636042,0.0000919698,0.00021411927],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004659969,0.00027292134,0.0003463857,0.00012239946,0.00019403877,0.00032122334,0.0021854066,0.000118947115,0.0009263967],"category_scores_gemma":[0.00020730475,0.0002487051,0.00009446001,0.00056775735,0.00006522766,0.0011535551,0.0002499064,0.00018353686,0.0058007184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023791622,0.0011836882,0.034653727,0.0006176066,0.0007286752,0.0013762757,0.030357106,0.005238403,0.08193655,0.056113597,0.056564663,0.7309918],"study_design_scores_gemma":[0.012321148,0.0034540538,0.14691137,0.0023191827,0.00045755808,0.0011326494,0.0013081469,0.4441887,0.056374773,0.012747924,0.3076687,0.011115794],"about_ca_topic_score_codex":0.0005219048,"about_ca_topic_score_gemma":0.00001588834,"teacher_disagreement_score":0.719876,"about_ca_system_score_codex":0.00004523951,"about_ca_system_score_gemma":0.000104218976,"threshold_uncertainty_score":0.99999654},"labels":[],"label_agreement":null},{"id":"W4248497488","doi":"10.1145/2914770.2837670","title":"Abstracting gradual typing","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"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; Subtyping; Programming language; Exception handling; Typing; Type theory; Consistency (knowledge bases); Syntax; Type inference; Sophistication; Type safety; Language construct; Abstract interpretation; Artificial intelligence; Type (biology)","score_opus":0.045522396434619354,"score_gpt":0.27214159085944234,"score_spread":0.22661919442482298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248497488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3471828,0.0010388503,0.5757047,0.008690319,0.0066251056,0.00062078616,0.0000034485922,0.002047117,0.05808686],"genre_scores_gemma":[0.99463046,0.0000051372554,0.0044214246,0.000115638024,0.00028216746,0.000005429589,7.741952e-7,0.0000074902564,0.00053147454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898446,0.00004404354,0.00018719195,0.00030380354,0.00017097911,0.00030950285],"domain_scores_gemma":[0.9986573,0.00048161118,0.00014182995,0.00059857784,0.00004202625,0.000078656485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033727085,0.000111888956,0.00012284114,0.000054162163,0.00013074893,0.00018944227,0.0010840412,0.00005573607,0.00002220226],"category_scores_gemma":[0.000322509,0.000068774745,0.000042557076,0.00012023334,0.000032347172,0.0005886593,0.0002440865,0.000069121415,0.0006125497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098988485,0.000072915755,0.025631733,0.00006273685,0.000062646184,0.00008961938,0.0020080488,0.00000956084,0.0052875765,0.34501997,0.0021173533,0.61962795],"study_design_scores_gemma":[0.004047845,0.0010587707,0.10717299,0.00026403955,0.00010289862,0.0004101238,0.0013426973,0.0029476045,0.038013056,0.2543089,0.5868099,0.0035211984],"about_ca_topic_score_codex":0.0000961998,"about_ca_topic_score_gemma":0.00004167387,"teacher_disagreement_score":0.64744765,"about_ca_system_score_codex":0.000018993442,"about_ca_system_score_gemma":0.000027384547,"threshold_uncertainty_score":0.7873292},"labels":[],"label_agreement":null},{"id":"W4248578803","doi":"10.1145/1449955.1449796","title":"Analyzing the performance of code-copying virtual machines","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Computer science; Bytecode; Copying; Programming language; Virtual machine; Just-in-time compilation; Interpreter; Parallel computing; PowerPC; Operating system; Pentium; Software","score_opus":0.02563609218180765,"score_gpt":0.26194069591475094,"score_spread":0.2363046037329433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248578803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7683076,0.00021713122,0.22985762,0.0003678799,0.00012354448,0.0000645425,0.000001376389,0.00023754644,0.0008227009],"genre_scores_gemma":[0.9262697,0.00009658428,0.073361725,0.000101694655,0.000043764485,0.0000025647876,0.0000017520179,0.0000050506487,0.00011718252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991969,0.00006213304,0.00021695023,0.00018887853,0.0001742742,0.00016089398],"domain_scores_gemma":[0.99877,0.00035752647,0.00016679603,0.0006080646,0.000067704925,0.000029880648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028339415,0.000099839424,0.00013658701,0.00008042743,0.0003051425,0.000042394913,0.0015430056,0.000033169476,0.0000062145523],"category_scores_gemma":[0.00012629661,0.00006829727,0.000040661005,0.00031953093,0.0000837302,0.00030777015,0.00031661318,0.00010895218,0.0000101766655],"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.00006724267,0.00023043815,0.4176972,0.00013675001,0.00016906425,0.00004209075,0.014165405,0.42916277,0.0031748102,0.015107793,0.00799355,0.1120529],"study_design_scores_gemma":[0.00013228212,0.00013479352,0.013756234,0.00004066977,0.00000744743,0.000023437959,0.00001730655,0.9766544,0.008453009,0.00012836872,0.00048980705,0.00016225986],"about_ca_topic_score_codex":0.00003216422,"about_ca_topic_score_gemma":0.0000033234608,"teacher_disagreement_score":0.5474916,"about_ca_system_score_codex":0.000007239915,"about_ca_system_score_gemma":0.00003153571,"threshold_uncertainty_score":0.2867314},"labels":[],"label_agreement":null},{"id":"W4249463296","doi":"10.1145/2775054.2694380","title":"Protecting Data on Smartphones and Tablets from Memory Attacks","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Dram; Code (set theory); Class (philosophy); Operating system; Memory protection; Computer hardware; Physical address; Memory management; Semiconductor memory; Virtual memory; Programming language","score_opus":0.17160734725140128,"score_gpt":0.3224399001503169,"score_spread":0.15083255289891564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249463296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9435481,0.00080799,0.0450578,0.005467496,0.0015710966,0.00034183273,0.000037243823,0.00045734557,0.0027110912],"genre_scores_gemma":[0.94968,0.0000044992435,0.049379826,0.000530398,0.00032203685,0.000005007096,0.000029085499,0.000007467425,0.00004169979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987176,0.000119222736,0.00017583884,0.0005407303,0.00025640338,0.00019020257],"domain_scores_gemma":[0.99717337,0.0009181791,0.00013196905,0.0016100714,0.000051891442,0.00011452792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161425,0.00011664779,0.00012915974,0.000052925792,0.00020722947,0.00033791192,0.0020357722,0.000057120695,0.000007583916],"category_scores_gemma":[0.0011939429,0.00010734496,0.0000100533125,0.00016113523,0.000036866935,0.00068929,0.0011949784,0.00019720988,0.00008456827],"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.00024041405,0.00068240036,0.036804784,0.00029109733,0.00032032712,0.0002376586,0.07283261,0.003911156,0.004978475,0.0135537,0.07407238,0.792075],"study_design_scores_gemma":[0.0025046081,0.0004793045,0.02595702,0.00043531152,0.00005590691,0.000053253378,0.003396417,0.8554562,0.01667294,0.017731635,0.075751394,0.0015060502],"about_ca_topic_score_codex":0.00046305492,"about_ca_topic_score_gemma":0.00005348134,"teacher_disagreement_score":0.851545,"about_ca_system_score_codex":0.000014694692,"about_ca_system_score_gemma":0.00005291418,"threshold_uncertainty_score":0.43774003},"labels":[],"label_agreement":null},{"id":"W4249626616","doi":"10.1145/1837852.1621615","title":"Transactional pointcuts","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Join (topology); Computer science; AspectJ; Sort-merge join; Programming language; Point (geometry); Semantics (computer science); Aspect-oriented programming; Joins; Mathematics; Software","score_opus":0.03643256248766095,"score_gpt":0.2933607549780999,"score_spread":0.2569281924904389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249626616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00598334,0.00015271622,0.98995525,0.0021870008,0.00040188938,0.00004706549,0.0000014788394,0.0006979303,0.00057335524],"genre_scores_gemma":[0.353435,0.000006365433,0.64601874,0.0003918083,0.00005839991,0.0000017390984,0.0000012056421,0.0000034305842,0.00008331719],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991954,0.00004184132,0.000120865494,0.00024426257,0.0001794431,0.00021816934],"domain_scores_gemma":[0.9985098,0.00082650397,0.000040031075,0.00054026616,0.000026895868,0.000056477715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001963734,0.000108877735,0.000116642565,0.00006866316,0.00006275774,0.000059087422,0.001040757,0.000046380468,0.000013352761],"category_scores_gemma":[0.00056268345,0.00009958295,0.000038915812,0.00017998835,0.000018402001,0.0005591075,0.000041488376,0.00012646569,0.000049477498],"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.00003924988,0.00014728833,0.00034311294,0.000034645815,0.000052975112,0.00015564072,0.0020621489,0.19919272,0.012151609,0.087618865,0.0021161092,0.69608563],"study_design_scores_gemma":[0.001430314,0.0010803347,0.11655845,0.00009952072,0.000039407467,0.00021470859,0.00010718914,0.018967908,0.0531321,0.78237367,0.024136461,0.0018599702],"about_ca_topic_score_codex":0.0000023026835,"about_ca_topic_score_gemma":0.0000010435475,"teacher_disagreement_score":0.6947548,"about_ca_system_score_codex":0.000018705448,"about_ca_system_score_gemma":0.000018573308,"threshold_uncertainty_score":0.4060875},"labels":[],"label_agreement":null},{"id":"W4249895474","doi":"10.1145/1837855.1806670","title":"A graph theoretic approach to cache-conscious placement of data for direct mapped caches","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Cache; Cache pollution; Cache algorithms; Parallel computing; Cache coloring; Cache invalidation; Bottleneck; Cache-oblivious algorithm; Page cache; Smart Cache; Optimizing compiler; CPU cache; Compiler; Operating system; Embedded system","score_opus":0.04559014292249517,"score_gpt":0.2956529427253662,"score_spread":0.250062799802871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249895474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018354602,0.000077337856,0.9736174,0.00058922666,0.00024791274,0.00066563685,0.00007793626,0.00038828354,0.0059816893],"genre_scores_gemma":[0.52257985,0.0000029884586,0.47712487,0.00012272714,0.000035351168,0.000028749735,0.000042784308,0.000007732384,0.00005498161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860716,0.00006316235,0.00027859604,0.00055870664,0.00022019735,0.00027219314],"domain_scores_gemma":[0.9968873,0.0006146508,0.00016531168,0.0021382887,0.00009384544,0.000100595775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008848399,0.00016154163,0.00024155468,0.00016768424,0.00011861557,0.00011507435,0.0037049653,0.00007462707,0.000003819596],"category_scores_gemma":[0.00054786674,0.00013780339,0.00004616554,0.00030007915,0.000080660815,0.0002544589,0.0009714543,0.000119159886,0.0000046214614],"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.0007060417,0.003977059,0.011920348,0.00194431,0.00097472756,0.000021115886,0.02919741,0.09058173,0.026201403,0.5626183,0.15815225,0.1137053],"study_design_scores_gemma":[0.0015238081,0.00069098175,0.0011762714,0.00010812793,0.00012638426,0.000021428077,0.00027267213,0.93416643,0.02942399,0.017282585,0.013966384,0.0012409452],"about_ca_topic_score_codex":0.000065873515,"about_ca_topic_score_gemma":0.000033369473,"teacher_disagreement_score":0.8435847,"about_ca_system_score_codex":0.000007066133,"about_ca_system_score_gemma":0.000058730806,"threshold_uncertainty_score":0.6884809},"labels":[],"label_agreement":null},{"id":"W4250583308","doi":"10.1145/2578855.2535885","title":"Proofs that count","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Computer science; Construct (python library); Argument (complex analysis); Programming language; Key (lock); Field (mathematics); Theoretical computer science; Counting problem; Calculus (dental); Algorithm; Mathematics; Computer security","score_opus":0.04731228292968221,"score_gpt":0.29187634142419716,"score_spread":0.24456405849451496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250583308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05660335,0.00009825289,0.92023,0.0013700551,0.001287661,0.00021611481,0.0000019584606,0.00042281812,0.019769805],"genre_scores_gemma":[0.54725665,0.0000025934876,0.45214415,0.00038845942,0.00007866343,0.000009773201,0.0000017116475,0.00000488559,0.000113150774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899405,0.00011808565,0.00013028689,0.00027247265,0.00027580385,0.00020932165],"domain_scores_gemma":[0.9983674,0.00029204847,0.000114276925,0.0011224538,0.00004296943,0.000060819035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075129786,0.00009824822,0.00010536151,0.000053859465,0.00009552816,0.00017216918,0.0017368034,0.000052312695,0.000016088668],"category_scores_gemma":[0.0006013313,0.00008289926,0.000025448506,0.0001522217,0.000039728042,0.0006787364,0.0002531596,0.00009482962,0.00027703153],"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.000015019287,0.00008454077,0.011445777,0.000092982,0.000022744869,0.0000051489214,0.0020422116,0.00026924632,0.0015867095,0.6548057,0.0032543896,0.3263755],"study_design_scores_gemma":[0.0007598948,0.0004914666,0.12106693,0.00009301206,0.00003158371,0.000035554614,0.00010569403,0.40602463,0.06647257,0.05292443,0.350987,0.0010072482],"about_ca_topic_score_codex":0.00001993901,"about_ca_topic_score_gemma":0.0000074761665,"teacher_disagreement_score":0.60188127,"about_ca_system_score_codex":0.000019996818,"about_ca_system_score_gemma":0.000019071103,"threshold_uncertainty_score":0.35607722},"labels":[],"label_agreement":null},{"id":"W4251269212","doi":"10.1145/2692915.2628149","title":"A theory of gradual effect systems","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Abstract interpretation; Decidability; Interpretation (philosophy); Type theory; Programming language; Model checking; Theoretical computer science; Type (biology); Software engineering","score_opus":0.02063144584475379,"score_gpt":0.2436307977274916,"score_spread":0.2229993518827378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251269212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2893239,0.0020854285,0.6690646,0.00023955919,0.0052629025,0.0009917301,0.0000028620534,0.00074470404,0.03228435],"genre_scores_gemma":[0.9988051,0.000001813801,0.0007049696,0.000037808197,0.00018957346,0.000016090225,0.0000025339464,0.000008048928,0.00023403436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848485,0.00046932427,0.00024125104,0.00027927145,0.00027824345,0.0002470873],"domain_scores_gemma":[0.99751455,0.001272637,0.00020186261,0.0008882253,0.000050185,0.00007255563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014744774,0.00013837905,0.00028285495,0.00007455121,0.00007015737,0.00013782812,0.0013634803,0.00007072532,0.0000037421178],"category_scores_gemma":[0.00044551402,0.00009647346,0.00006664952,0.00017291684,0.00006047387,0.00021079024,0.00022379268,0.00008270959,0.000115404284],"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.000014635083,0.000037918002,0.0072781704,0.0002773894,0.000047266498,0.000008102152,0.00096603256,0.00006405842,0.00033869114,0.9582461,0.00039661504,0.03232503],"study_design_scores_gemma":[0.009938391,0.016085587,0.055704705,0.00052018143,0.00062138133,0.00047919597,0.0016722726,0.11885864,0.041439258,0.50278854,0.24682288,0.00506895],"about_ca_topic_score_codex":0.00015056242,"about_ca_topic_score_gemma":0.000010313377,"teacher_disagreement_score":0.70948124,"about_ca_system_score_codex":0.000009011903,"about_ca_system_score_gemma":0.000017098566,"threshold_uncertainty_score":0.39340734},"labels":[],"label_agreement":null},{"id":"W4253384962","doi":"10.1145/381694.378827","title":"Bytecode compression via profiled grammar rewriting","year":2001,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bytecode; Computer science; Programming language; Grammar; Rewriting; Interpreter; Linguistics","score_opus":0.023822481168956956,"score_gpt":0.26405382660562954,"score_spread":0.24023134543667257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253384962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08993967,0.00053970737,0.90218246,0.0014329486,0.0008983496,0.00036057472,0.000011557334,0.00072301674,0.0039117374],"genre_scores_gemma":[0.79667646,0.000047605852,0.20207916,0.00045464904,0.00036736036,0.000021094897,0.000068206245,0.000020526031,0.00026491936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998143,0.000100519384,0.00032311128,0.00056276855,0.0004178797,0.00045267402],"domain_scores_gemma":[0.99788827,0.00033712946,0.00019852296,0.0013362569,0.00007639353,0.00016341823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029528863,0.0002135922,0.00022785703,0.00010242754,0.00035649363,0.00026949996,0.0021987658,0.00010081415,0.00008443875],"category_scores_gemma":[0.00012934075,0.00017351526,0.000057321253,0.00031820068,0.00004226667,0.0011385845,0.0012309625,0.00022752989,0.00021132249],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008019148,0.00034485638,0.014051081,0.00009750245,0.00004718126,0.0004710276,0.00096973137,0.0005597559,0.020208646,0.0026232053,0.011196687,0.9493501],"study_design_scores_gemma":[0.0014547774,0.00029535487,0.017406382,0.00036964857,0.000031079355,0.00021255559,0.00010053643,0.87661123,0.010443778,0.00998139,0.08202488,0.0010683796],"about_ca_topic_score_codex":0.00020540065,"about_ca_topic_score_gemma":0.000024017629,"teacher_disagreement_score":0.94828176,"about_ca_system_score_codex":0.000022243237,"about_ca_system_score_gemma":0.000024154564,"threshold_uncertainty_score":0.7075747},"labels":[],"label_agreement":null},{"id":"W4253459289","doi":"10.1145/3140587.3062359","title":"Context transformations for pointer analysis","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reachability; Pointer analysis; Computer science; Pointer (user interface); Theoretical computer science; Programming language; Context (archaeology); Static analysis; Artificial intelligence","score_opus":0.045198285786666716,"score_gpt":0.29625754878501864,"score_spread":0.2510592629983519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253459289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009356438,0.0001348757,0.97637606,0.0029161824,0.00061784044,0.00033895785,0.00001023093,0.00013332744,0.01011608],"genre_scores_gemma":[0.9944708,0.000002798853,0.0046497076,0.00018670314,0.000088275774,0.00003212826,0.000012283138,0.000004057686,0.0005532681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992396,0.000022460434,0.00018785351,0.00021497883,0.0001270478,0.00020805391],"domain_scores_gemma":[0.99839777,0.00017208059,0.00017731816,0.0011127546,0.0000769298,0.000063163185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026839777,0.00009490648,0.00018675486,0.00009550212,0.00047906852,0.0007531372,0.0018268094,0.000047498957,0.000018835717],"category_scores_gemma":[0.00016494165,0.00007327061,0.00016328326,0.000091394555,0.00004344849,0.0007965943,0.00010260185,0.000047115514,0.00008211151],"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.000029326284,0.00013219191,0.026190441,0.00012870364,0.0011953044,0.000013576991,0.010767533,0.00009423136,0.000091769245,0.7861718,0.0049936143,0.17019153],"study_design_scores_gemma":[0.005581957,0.00094077917,0.08674537,0.00003026646,0.0017459266,0.00002571746,0.0017517853,0.15744331,0.0046358425,0.12877369,0.61046696,0.0018583765],"about_ca_topic_score_codex":0.0002524625,"about_ca_topic_score_gemma":0.0010360691,"teacher_disagreement_score":0.98511434,"about_ca_system_score_codex":0.0000097681395,"about_ca_system_score_gemma":0.000018311835,"threshold_uncertainty_score":0.72625196},"labels":[],"label_agreement":null},{"id":"W4254059104","doi":"10.1145/2714064.2660218","title":"MIX10","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Programming language; MATLAB; Concurrency; Set (abstract data type); Parallel computing","score_opus":0.016994453282950704,"score_gpt":0.25460416065250485,"score_spread":0.23760970736955414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254059104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070305667,0.000049057937,0.9711375,0.0013590291,0.00022297227,0.00004883683,3.842438e-7,0.00085899007,0.019292632],"genre_scores_gemma":[0.64503014,0.000003816727,0.35399,0.0006678624,0.0000701518,0.0000022737688,0.0000018462467,0.000004112899,0.00022980988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999275,0.00006381491,0.0001224794,0.00022823075,0.00014073,0.00016968897],"domain_scores_gemma":[0.99884737,0.0002676547,0.00006836199,0.0007206562,0.000038993152,0.00005698997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025915413,0.00008439293,0.00009636758,0.000065288164,0.00009716916,0.00014589686,0.0014128222,0.000040705367,0.000011125984],"category_scores_gemma":[0.00026731964,0.00007428339,0.000027957552,0.00016216876,0.000020481912,0.00022735975,0.00028352233,0.00007002852,0.00013329618],"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.000015471482,0.00022566525,0.011904112,0.00008027592,0.000059169277,0.000023457142,0.0024428866,0.025301911,0.0009968827,0.48988354,0.09773421,0.3713324],"study_design_scores_gemma":[0.00036516011,0.00020632523,0.005565242,0.0000404393,0.000008711115,0.000012942397,0.000010268768,0.842205,0.0069841673,0.030666944,0.11343039,0.0005043985],"about_ca_topic_score_codex":0.00001769604,"about_ca_topic_score_gemma":0.0000031334748,"teacher_disagreement_score":0.8169031,"about_ca_system_score_codex":0.000006551744,"about_ca_system_score_gemma":0.0000121242,"threshold_uncertainty_score":0.30291888},"labels":[],"label_agreement":null},{"id":"W4254363650","doi":"10.1145/2858965.2814305","title":"Incremental computation with names","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Defense Advanced Research Projects Agency; Center for Selective C-H Functionalization, National Science Foundation","keywords":"Computation; Computer science; Class (philosophy); Scratch; Probabilistic logic; Theoretical computer science; Functional programming; State (computer science); Programming language; Artificial intelligence","score_opus":0.0406810661610968,"score_gpt":0.2739843194412407,"score_spread":0.2333032532801439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254363650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36779308,0.00025059917,0.625621,0.0012210374,0.0005241249,0.00019156869,0.000012940508,0.00035017545,0.004035445],"genre_scores_gemma":[0.7970473,0.0000012612926,0.2026271,0.00019696167,0.00006645338,0.000003041337,0.000024141897,0.000004504393,0.000029218103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991679,0.000036115453,0.0001022568,0.00022899255,0.00031816593,0.00014656893],"domain_scores_gemma":[0.9992757,0.00008964507,0.00007492122,0.00038995498,0.00006199308,0.00010780277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014835682,0.0000914287,0.00009005263,0.000046421403,0.000076287244,0.00018513406,0.0007658963,0.000025317011,0.00000541108],"category_scores_gemma":[0.000041439842,0.000064815016,0.000011003653,0.00014115521,0.000028202621,0.0008603332,0.0004006996,0.000061862,0.00008026227],"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.00034904692,0.0008114463,0.07640538,0.000115171635,0.0002169407,0.00053099816,0.014018831,0.017205901,0.0017761034,0.03150702,0.12325748,0.73380566],"study_design_scores_gemma":[0.0051958044,0.002303591,0.05451621,0.00024985353,0.000056871082,0.00018317607,0.0017414772,0.8696501,0.0065334914,0.013825704,0.044229206,0.0015144749],"about_ca_topic_score_codex":0.00013947101,"about_ca_topic_score_gemma":0.000023503484,"teacher_disagreement_score":0.85244423,"about_ca_system_score_codex":0.000020345737,"about_ca_system_score_gemma":0.00004890122,"threshold_uncertainty_score":0.26430798},"labels":[],"label_agreement":null},{"id":"W4254630438","doi":"10.1145/1508284.1508281","title":"Phantom-BTB","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Granularity; Working set; Overhead (engineering); Random access; Parallel computing; Table (database); Embedded system; Operating system; Database","score_opus":0.021253206978345544,"score_gpt":0.27922439181900605,"score_spread":0.2579711848406605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254630438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013211447,0.00031405894,0.95206136,0.0046671703,0.0002688032,0.00012086908,0.0000011485039,0.0018186601,0.02753647],"genre_scores_gemma":[0.72299373,0.000014971579,0.27530318,0.0013717365,0.000069717535,0.0000012984399,0.0000024738338,0.0000030471779,0.00023982748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991606,0.000038902188,0.00014906457,0.0002614649,0.00017611723,0.00021384774],"domain_scores_gemma":[0.99901086,0.00011857435,0.00007842572,0.0006787027,0.000046318455,0.00006709918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743409,0.00010502056,0.00011288163,0.000089105124,0.000108841174,0.00018103766,0.0015111866,0.000047557336,0.000012296509],"category_scores_gemma":[0.00012209448,0.00009379094,0.00003499144,0.0002538587,0.000015650277,0.0003653439,0.00014184449,0.00008344732,0.00008691188],"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.00003076326,0.0004885583,0.0029337753,0.000032982458,0.000053233805,0.00015858759,0.0034135499,0.016086003,0.0026617027,0.2233522,0.098336205,0.65245247],"study_design_scores_gemma":[0.0013030611,0.0011873207,0.027708763,0.00015351272,0.00003159376,0.00007974727,0.000045993318,0.7374968,0.039890517,0.11833516,0.07205095,0.001716593],"about_ca_topic_score_codex":0.000009486961,"about_ca_topic_score_gemma":0.0000013522866,"teacher_disagreement_score":0.72141075,"about_ca_system_score_codex":0.00001099696,"about_ca_system_score_gemma":0.00002189646,"threshold_uncertainty_score":0.38246837},"labels":[],"label_agreement":null},{"id":"W4254689785","doi":"10.1145/2517326.2451541","title":"A modular approach to on-stack replacement in LLVM","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Just-in-time compilation; Modular design; Programming language; Optimizing compiler; Operating system; Interrupt; Dynamic compilation; Virtual machine; Code generation; Embedded system; Parallel computing; Key (lock)","score_opus":0.026329957680627594,"score_gpt":0.2605417547975208,"score_spread":0.2342117971168932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254689785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12418299,0.000043880376,0.8432951,0.0026822,0.00016214803,0.00074174895,0.0000013553033,0.00062006904,0.02827052],"genre_scores_gemma":[0.6075126,0.0000028667666,0.39093822,0.0011842904,0.000025005962,0.000055835837,0.0000032307928,0.0000063667544,0.00027156473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987273,0.00007381494,0.00022368687,0.0004510246,0.00024395452,0.00028021508],"domain_scores_gemma":[0.9986577,0.00012723896,0.00006840142,0.0009962735,0.000049954822,0.000100412966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027844735,0.00013704311,0.00015167678,0.00019824447,0.00006231164,0.00021373195,0.0013825718,0.00005197268,0.0000135395085],"category_scores_gemma":[0.00015749678,0.000121462486,0.000027072538,0.00038494088,0.000012969167,0.00026922682,0.00039182164,0.00011470042,0.00025935483],"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.00006907035,0.001490121,0.009382026,0.000117395284,0.0000643818,0.000026164218,0.009708523,0.7586639,0.001107499,0.082438625,0.0986508,0.03828149],"study_design_scores_gemma":[0.00035989867,0.0003198305,0.0097490065,0.00005898281,0.00000230392,0.000003125844,0.00006149922,0.9807005,0.0011549601,0.0032432673,0.0039677257,0.00037893484],"about_ca_topic_score_codex":0.00015383614,"about_ca_topic_score_gemma":0.0000042344946,"teacher_disagreement_score":0.48332962,"about_ca_system_score_codex":0.000039820457,"about_ca_system_score_gemma":0.00002069275,"threshold_uncertainty_score":0.49530965},"labels":[],"label_agreement":null},{"id":"W4254768160","doi":"10.1145/2936313.2816713","title":"Compiling for multi-language task migration","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Software portability; Programming language; Python (programming language); Just-in-time compilation; JavaScript; Java; Host (biology); Task (project management); Virtual machine; Dynamic compilation","score_opus":0.09100097469133157,"score_gpt":0.31874805150993263,"score_spread":0.22774707681860107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254768160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06294617,0.0007646131,0.93321115,0.00045472218,0.0012114418,0.00044772617,0.0000040484956,0.00031612517,0.00064402336],"genre_scores_gemma":[0.9136695,0.0000012757614,0.08561119,0.0001455151,0.00021326731,0.000025557709,0.00002513173,0.0000074106442,0.00030113853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909115,0.000048143156,0.0001778344,0.00027161156,0.00017970745,0.00023154775],"domain_scores_gemma":[0.99901265,0.00016856956,0.00011851211,0.00049739087,0.00009714922,0.000105701896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004233378,0.00010989467,0.00013971353,0.00005425707,0.00009207585,0.00023088128,0.00082871073,0.00005836288,0.0000016615674],"category_scores_gemma":[0.00033873663,0.000088857516,0.000044486773,0.000121333724,0.000022090295,0.00036143285,0.0001309341,0.00005644571,0.00008843756],"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.0001594258,0.0010459349,0.08330575,0.0006878044,0.0003004307,0.00018774514,0.1503073,0.0021244118,0.010078972,0.38927624,0.029925724,0.3326003],"study_design_scores_gemma":[0.0045140376,0.001067907,0.0041009285,0.000031217303,0.00007314164,0.000045382298,0.005393202,0.8065194,0.008053682,0.014204135,0.15475588,0.0012410838],"about_ca_topic_score_codex":0.00030950844,"about_ca_topic_score_gemma":0.00045979494,"teacher_disagreement_score":0.8507233,"about_ca_system_score_codex":0.000021994614,"about_ca_system_score_gemma":0.000042477015,"threshold_uncertainty_score":0.36235043},"labels":[],"label_agreement":null},{"id":"W4254776403","doi":"10.1145/2817817.2731195","title":"Towards VM Consolidation Using a Hierarchy of Idle States","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Idle; Computer science; Virtualization; Virtual machine; Latency (audio); Distributed computing; Hierarchy; Memory hierarchy; Operating system; Cloud computing; Cache; Telecommunications","score_opus":0.06155140186437679,"score_gpt":0.29242001080422236,"score_spread":0.23086860893984557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254776403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587194,0.00015406667,0.03739011,0.00070292334,0.00033339145,0.00009750808,0.000002472969,0.000107899315,0.0024922297],"genre_scores_gemma":[0.9522692,0.0000015148439,0.04743523,0.00013284585,0.00007115234,0.000001223903,0.0000031978727,0.000005528405,0.000080108235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898636,0.000077389865,0.00020832733,0.00022277878,0.0003123994,0.00019273398],"domain_scores_gemma":[0.9989721,0.000142908,0.00015352196,0.0005449701,0.00009921589,0.00008725086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042281978,0.00009647329,0.00014543968,0.000110945046,0.00005951466,0.000100945326,0.0009225878,0.000030374908,0.000004062452],"category_scores_gemma":[0.00017262832,0.000082405015,0.000033179902,0.00026349456,0.00005172016,0.000058871472,0.0006345105,0.00006359766,0.00001590578],"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.00010652767,0.0006239318,0.014410741,0.00043710283,0.00034937583,0.00013360713,0.039996564,0.58638877,0.0024629915,0.04551696,0.007847472,0.30172598],"study_design_scores_gemma":[0.000651175,0.00022498771,0.0015470687,0.00008597295,0.000029309831,0.000010491636,0.000750588,0.97484607,0.0043527572,0.009950078,0.007277957,0.00027355098],"about_ca_topic_score_codex":0.0003694311,"about_ca_topic_score_gemma":0.000008665811,"teacher_disagreement_score":0.38845733,"about_ca_system_score_codex":0.000030127976,"about_ca_system_score_gemma":0.00006651091,"threshold_uncertainty_score":0.3360379},"labels":[],"label_agreement":null},{"id":"W4255025547","doi":"10.1145/1837853.1693465","title":"Scheduling support for transactional memory contention management","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Transactional memory; Scheduling (production processes); Implementation; Database transaction; Transactional leadership; Distributed computing; Operating system; Transaction processing; Software transactional memory; Linux kernel; Parallel computing; Database; Programming language","score_opus":0.020213033304827877,"score_gpt":0.2651542776782818,"score_spread":0.24494124437345394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255025547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061689977,0.000034847944,0.92863667,0.0010350618,0.0027733773,0.00043100727,0.0000542498,0.00018065171,0.005164182],"genre_scores_gemma":[0.91091865,0.0000019250194,0.08789027,0.00017926464,0.000143987,0.000055498665,0.000039523235,0.0000063310204,0.0007645747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904627,0.0000125953975,0.00021052768,0.00029958496,0.00021129893,0.0002197234],"domain_scores_gemma":[0.99919784,0.000101435915,0.000093003924,0.00046158975,0.00007726758,0.00006883699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032263526,0.000104156956,0.00012181006,0.000053552838,0.00014528705,0.00016883966,0.00079053646,0.00005938813,0.000042964013],"category_scores_gemma":[0.000028666534,0.00009661215,0.00007511684,0.00009911389,0.000023772878,0.00046759134,0.000046059955,0.00011032368,0.00005596018],"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.00022938444,0.0006680642,0.0019865532,0.0009843914,0.0005003483,0.00012248519,0.0017052799,0.0034975817,0.032291844,0.51466733,0.008627482,0.43471923],"study_design_scores_gemma":[0.009174037,0.00088836474,0.040150616,0.00028553823,0.0002422031,0.00016862844,0.0013966216,0.3664845,0.016007865,0.015580069,0.5472813,0.0023402541],"about_ca_topic_score_codex":0.000014461595,"about_ca_topic_score_gemma":0.000038158676,"teacher_disagreement_score":0.8492287,"about_ca_system_score_codex":0.000009275853,"about_ca_system_score_gemma":0.0000198741,"threshold_uncertainty_score":0.3939729},"labels":[],"label_agreement":null},{"id":"W4255038300","doi":"10.1145/3263338","title":"Session details: Dynamic analysis and runtime","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Session (web analytics); Programming language; Parallel computing; World Wide Web","score_opus":0.011950922221625433,"score_gpt":0.25668768837505623,"score_spread":0.2447367661534308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255038300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982712,0.00034886214,0.80054927,0.0001251614,0.00009222112,0.00005877649,0.0000023465986,0.00049492286,0.00005723022],"genre_scores_gemma":[0.60866475,0.000014516351,0.3912092,0.00004189461,0.000018790439,0.0000057538145,0.0000042402844,0.000005894439,0.000034947563],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990584,0.000041306157,0.00015253498,0.0002580287,0.00019596617,0.0002937339],"domain_scores_gemma":[0.99879724,0.00016087701,0.00007401132,0.00081328745,0.000028381719,0.00012623137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002854291,0.00014141478,0.00019440327,0.0002473894,0.00007502857,0.00010756575,0.00079637126,0.000071378454,0.000014880634],"category_scores_gemma":[0.00002927223,0.00012292751,0.000052821142,0.00051703595,0.000025732901,0.00084222364,0.0004795535,0.000105863684,0.000026586962],"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.000012104955,0.00023153349,0.5838933,0.0001516851,0.00080633233,0.00003073166,0.0046179807,0.0017881215,0.007303193,0.031890783,0.0006537498,0.36862049],"study_design_scores_gemma":[0.0002560861,0.00009637296,0.48287728,0.000067120665,0.0004673264,0.000021959615,0.000015327243,0.49370295,0.0061507765,0.0012088874,0.014279312,0.0008565888],"about_ca_topic_score_codex":0.000042710868,"about_ca_topic_score_gemma":0.000016102314,"teacher_disagreement_score":0.4919148,"about_ca_system_score_codex":0.000023893346,"about_ca_system_score_gemma":0.000008637523,"threshold_uncertainty_score":0.5012838},"labels":[],"label_agreement":null},{"id":"W4255874599","doi":"10.1145/3262847","title":"Session details: Runtime optimization and profiling","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Profiling (computer programming); Session (web analytics); Programming language; World Wide Web","score_opus":0.014329058461970304,"score_gpt":0.23592972625635042,"score_spread":0.22160066779438012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255874599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18916848,0.0004707347,0.80555433,0.00040313866,0.0004049038,0.00017783603,0.0000053475173,0.00034776365,0.00346743],"genre_scores_gemma":[0.8855709,0.0000027746153,0.11406869,0.00004624779,0.00012799323,0.0000030133815,0.000034249642,0.0000054670877,0.00014070327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990905,0.000059841535,0.00019411337,0.00028962333,0.00016979783,0.00019610667],"domain_scores_gemma":[0.99925476,0.00016710612,0.00011808,0.0003695214,0.000047139503,0.00004339115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022211905,0.00011076212,0.00012362406,0.000056690387,0.00015936427,0.00033478186,0.00054746977,0.000055222165,0.0000045443435],"category_scores_gemma":[0.00005255341,0.000094735624,0.000020511508,0.00019275509,0.000020051764,0.0003959799,0.00022065997,0.00006559359,0.000023192666],"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.000014425503,0.00014775191,0.07156785,0.00020337224,0.00003527825,0.000055697434,0.0006055917,0.8825818,0.0019881155,0.028704943,0.00358924,0.0105059575],"study_design_scores_gemma":[0.00030400476,0.00004856434,0.004802575,0.00007904199,0.000010169998,0.000019554702,0.00002898536,0.99067074,0.000987807,0.0010548659,0.0017522209,0.00024145638],"about_ca_topic_score_codex":0.00008241077,"about_ca_topic_score_gemma":0.0000053870717,"teacher_disagreement_score":0.6964024,"about_ca_system_score_codex":0.000010215669,"about_ca_system_score_gemma":0.000021441549,"threshold_uncertainty_score":0.38632065},"labels":[],"label_agreement":null},{"id":"W4255914661","doi":"10.1145/1735971.1736038","title":"SherLog","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"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; Unavailability; Task (project management); Code (set theory); Software; Software bug; Source code; Operating system; Server; Programming language; Software engineering; Reliability engineering; Set (abstract data type)","score_opus":0.01029332178757227,"score_gpt":0.2435370911879403,"score_spread":0.23324376940036803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255914661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858609,0.000046508627,0.0046671843,0.0013622228,0.0026999512,0.00011496511,0.0000015105874,0.00041114085,0.0048356317],"genre_scores_gemma":[0.9750705,0.0000022127836,0.024285616,0.00027341783,0.00020716246,0.0000076066153,0.0000014734452,0.000004697985,0.00014734585],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99913454,0.000022278538,0.00015484467,0.00027770398,0.00019071241,0.00021992132],"domain_scores_gemma":[0.99828756,0.00025064152,0.000060450635,0.001272869,0.000049192196,0.000079270554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032665938,0.00009169649,0.00011272082,0.000044637443,0.00011096488,0.0001234585,0.0016425342,0.000088020206,0.000058242815],"category_scores_gemma":[0.00028200052,0.00007130304,0.000041304924,0.00017205437,0.000049129274,0.0005233095,0.0002737769,0.00020799659,0.0005867693],"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.000018713627,0.00024203937,0.59188896,0.000214437,0.00005703227,0.00005952995,0.0037170248,0.00009318153,0.010930058,0.019267043,0.011091786,0.3624202],"study_design_scores_gemma":[0.00097422436,0.0002944796,0.8101428,0.000056562323,0.00002397,0.00009961293,0.000105848536,0.01207119,0.015923016,0.015366843,0.14387827,0.0010631878],"about_ca_topic_score_codex":0.000066834225,"about_ca_topic_score_gemma":0.00008281622,"teacher_disagreement_score":0.361357,"about_ca_system_score_codex":0.0000059125114,"about_ca_system_score_gemma":0.00004008547,"threshold_uncertainty_score":0.7541928},"labels":[],"label_agreement":null},{"id":"W4256274801","doi":"10.1145/1035292.1028990","title":"Measuring the dynamic behaviour of AspectJ programs","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Computer science; Bytecode; Programming language; Aspect-oriented programming; Compiler; Generator (circuit theory); TRACE (psycholinguistics); Range (aeronautics); Software engineering; Software; Java","score_opus":0.0626233988809188,"score_gpt":0.2914698221625884,"score_spread":0.22884642328166957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256274801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21199082,0.00032177614,0.78637594,0.0004373323,0.00031255305,0.0001356169,0.0000010087407,0.00036519117,0.0000597924],"genre_scores_gemma":[0.59860903,0.0000054174375,0.40133017,0.000015433034,0.000013994863,0.000008794744,7.502238e-7,0.000006650911,0.000009744607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990181,0.000056380206,0.00018329483,0.00023827095,0.00025885427,0.00024509797],"domain_scores_gemma":[0.99826294,0.0005971091,0.00011422286,0.00093712914,0.000052109397,0.000036472386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043383733,0.00012526919,0.00015425717,0.00005445147,0.000077424374,0.000058289534,0.0019236194,0.000044200577,0.0000010973841],"category_scores_gemma":[0.0009409325,0.0000878547,0.000051643616,0.00027858978,0.00007977687,0.00029951803,0.00037927888,0.00016210653,0.000009817695],"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.000025115087,0.00032213653,0.016161282,0.0002136355,0.00014817505,0.0001371446,0.010000116,0.61915857,0.009673936,0.047013998,0.00001812457,0.29712775],"study_design_scores_gemma":[0.0029900547,0.0016245081,0.39394844,0.00088114094,0.00021100725,0.00025758156,0.0018146231,0.008740732,0.12685286,0.45942956,0.00072231697,0.0025271806],"about_ca_topic_score_codex":0.00004970704,"about_ca_topic_score_gemma":0.00004220243,"teacher_disagreement_score":0.61041784,"about_ca_system_score_codex":0.00004290171,"about_ca_system_score_gemma":0.000036735517,"threshold_uncertainty_score":0.35826108},"labels":[],"label_agreement":null},{"id":"W4256519592","doi":"10.1145/2499368.2451124","title":"Power containers","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Server; Multi-core processor; Cloud computing; Operating system; Power management; Efficient energy use; Power (physics); Power budget; Embedded system; Distributed computing; Power control","score_opus":0.010804996988355065,"score_gpt":0.22138483710678744,"score_spread":0.21057984011843237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256519592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9337333,0.00013075385,0.008028399,0.008991236,0.00060485245,0.00021588807,3.9224312e-7,0.00044522938,0.04784994],"genre_scores_gemma":[0.9875219,6.005106e-7,0.009565637,0.0014184297,0.000065979504,0.000008121221,6.21954e-7,0.0000060656607,0.0014126475],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907315,0.000036561447,0.0001386764,0.00027510608,0.00020562997,0.00027087305],"domain_scores_gemma":[0.9988099,0.00019879095,0.000065047665,0.00080035743,0.000039927294,0.00008598599],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013980121,0.00010888184,0.00010604134,0.00006572466,0.00010082325,0.00027524921,0.0015446107,0.000032214975,0.00011421072],"category_scores_gemma":[0.000087152795,0.000085095264,0.00004241062,0.00016682973,0.00002845553,0.000059935122,0.0006653787,0.00008450977,0.0010100822],"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.00001788468,0.0005617019,0.031664833,0.00014314543,0.00043776614,0.00027938123,0.014220776,0.01879198,0.0031855498,0.20217991,0.3788164,0.3497007],"study_design_scores_gemma":[0.0023720125,0.000858035,0.16252516,0.00017350167,0.000045190125,0.000046741752,0.0022284966,0.41588572,0.0016483743,0.023373682,0.38865036,0.0021927175],"about_ca_topic_score_codex":0.00016574224,"about_ca_topic_score_gemma":0.0000038632675,"teacher_disagreement_score":0.39709374,"about_ca_system_score_codex":0.0000146735265,"about_ca_system_score_gemma":0.000010073329,"threshold_uncertainty_score":0.9997677},"labels":[],"label_agreement":null}]}