{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009964787,0.0030847162,0.8992208,0.022289798,0.0012544935,0.00015502668,0.00022993326,0.0025897603,0.061210625],"genre_scores_gemma":[0.51360446,0.0050121914,0.43156156,0.012805136,0.0033174772,0.00082858186,0.0004413708,0.0033582635,0.029070986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98371327,0.004441793,0.0014710249,0.0031481173,0.0059789475,0.0012468698],"domain_scores_gemma":[0.96655935,0.012319687,0.0013699223,0.013305173,0.005355673,0.0010902772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017138883,0.0010562943,0.002711659,0.0026940037,0.003761027,0.007895913,0.00435326,0.005029702,0.006591954],"category_scores_gemma":[0.041166816,0.0016105123,0.0032676063,0.0023231625,0.01805998,0.037881885,0.007826549,0.010916343,0.0048319018],"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.00002092117,0.000014520709,0.00034101953,0.00008245345,0.000013122748,0.000047048983,0.0003090594,0.00058495475,0.0002744195,0.98316216,0.003194628,0.011955739],"study_design_scores_gemma":[0.000018530352,0.000023332012,0.0001482118,0.00006777107,0.000021893034,0.00032095186,0.00013361934,0.0027024006,0.0005528197,0.95985955,0.036120225,0.000030705232],"about_ca_topic_score_codex":0.0033073132,"about_ca_topic_score_gemma":0.0021579578,"teacher_disagreement_score":0.017138883,"about_ca_system_score_codex":0.0029769423,"about_ca_system_score_gemma":0.0044259233,"threshold_uncertainty_score":0.09064019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035378702,0.0022002691,0.8400386,0.0068221833,0.0015883638,0.00042141712,0.0013933149,0.019066807,0.09309026],"genre_scores_gemma":[0.3971876,0.0022011697,0.49079838,0.007613549,0.000788802,0.00047932265,0.0018182811,0.018408459,0.080704466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434644,0.0011760995,0.00035656313,0.0014695295,0.0018604705,0.0007909748],"domain_scores_gemma":[0.9916944,0.002154147,0.00045477456,0.00394354,0.0013901946,0.00036302075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003420395,0.002244084,0.0014443473,0.002150975,0.0030713244,0.008317025,0.0023023568,0.002319418,0.032483924],"category_scores_gemma":[0.019789353,0.0017514128,0.0024631114,0.0014180993,0.0040451623,0.017880632,0.008028519,0.0045581516,0.018418886],"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.00064938184,0.000112419526,0.0079258345,0.00062583934,0.00016305408,0.000838287,0.0028978644,0.009436856,0.013542544,0.6812559,0.049849957,0.23270212],"study_design_scores_gemma":[0.000049851777,0.00008931741,0.0014316294,0.00042532673,0.00017716397,0.00070430513,0.0014044092,0.023890784,0.021714149,0.62218297,0.32773957,0.00019057668],"about_ca_topic_score_codex":0.0031127068,"about_ca_topic_score_gemma":0.004110958,"teacher_disagreement_score":0.032483924,"about_ca_system_score_codex":0.0018233462,"about_ca_system_score_gemma":0.002286417,"threshold_uncertainty_score":0.10866958},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00703615,0.010262117,0.018785967,0.22119805,0.027069617,0.00008322174,0.000305211,0.00032876938,0.71493095],"genre_scores_gemma":[0.13876733,0.014207495,0.007834179,0.030995118,0.018080072,0.00033168853,0.00029523534,0.0007933454,0.7886955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779606,0.0009497139,0.00009047734,0.00017772814,0.0007557687,0.00023018931],"domain_scores_gemma":[0.9927557,0.0053271083,0.00022221713,0.0004993497,0.00093891466,0.00025664334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030990485,0.00060236536,0.00025635742,0.0010724002,0.0067227697,0.0043301573,0.0013214672,0.00242228,0.035639845],"category_scores_gemma":[0.009568153,0.00026789447,0.00040321355,0.0018004178,0.0071410546,0.007058583,0.0030083032,0.009161858,0.005022811],"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.000029612542,0.000018822035,0.00007948912,0.000054125765,0.0000015091675,0.00019010452,0.006336866,0.00009797638,0.00021477374,0.72035915,0.2584247,0.014192884],"study_design_scores_gemma":[0.0000038664125,0.000007181839,0.00008113304,0.00009863354,6.481154e-7,0.000072894465,0.00097522355,0.00006899982,0.000118990414,0.051319923,0.94724613,0.0000064952965],"about_ca_topic_score_codex":0.0064461296,"about_ca_topic_score_gemma":0.0066550253,"teacher_disagreement_score":0.035639845,"about_ca_system_score_codex":0.00473115,"about_ca_system_score_gemma":0.0021251633,"threshold_uncertainty_score":0.11922717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009030902,0.0065713963,0.8088655,0.012277628,0.015440337,0.00015705691,0.0019147312,0.009608258,0.13613424],"genre_scores_gemma":[0.23348951,0.009611245,0.5052313,0.014082313,0.0056041456,0.0005138738,0.0022761612,0.013733956,0.21545745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966761,0.0009395297,0.0003325781,0.00075978047,0.0008977344,0.00039431517],"domain_scores_gemma":[0.99418604,0.0016142286,0.0004538587,0.0021811514,0.0011434789,0.00042113886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028636735,0.0011890131,0.0011337412,0.0020652902,0.0038831485,0.0062739057,0.002281154,0.002617488,0.027578665],"category_scores_gemma":[0.0103586055,0.0011163582,0.0016198562,0.0030340392,0.0066652712,0.017822133,0.0057806903,0.007792435,0.015655337],"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.000048723403,0.000014428593,0.0003377066,0.00016451976,0.000015927526,0.00012316591,0.0009000623,0.00017985974,0.0011665636,0.91929114,0.04118582,0.03657199],"study_design_scores_gemma":[0.000011713994,0.000031443757,0.00019318481,0.00013626681,0.000026174384,0.00058588746,0.0003518531,0.0005000994,0.002225209,0.32523736,0.67065954,0.000041337593],"about_ca_topic_score_codex":0.0018028968,"about_ca_topic_score_gemma":0.002089627,"teacher_disagreement_score":0.027578665,"about_ca_system_score_codex":0.0017501601,"about_ca_system_score_gemma":0.0023598615,"threshold_uncertainty_score":0.092259765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01471902,0.0023796663,0.81362444,0.021857955,0.0019118248,0.0004088666,0.0003342569,0.007869168,0.13689484],"genre_scores_gemma":[0.17609361,0.0026783675,0.71717805,0.0042829225,0.0009886654,0.00086322083,0.0010157662,0.006677417,0.090222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9820999,0.007733787,0.00087419845,0.0028504678,0.0053814882,0.0010602385],"domain_scores_gemma":[0.96625775,0.011808662,0.0011360637,0.012843755,0.005338986,0.00261479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014811282,0.00094881066,0.00065678585,0.0019360514,0.0040264307,0.00967404,0.0026808353,0.0023384432,0.02937423],"category_scores_gemma":[0.05364676,0.00129686,0.0010725709,0.002000459,0.007259808,0.014905214,0.009213962,0.007776496,0.012964314],"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.00012796892,0.00020613839,0.0012861302,0.00034594288,0.000026130254,0.0001643818,0.004002646,0.003933018,0.00346096,0.5198853,0.09448976,0.37207153],"study_design_scores_gemma":[0.00006009609,0.00016390694,0.0007749327,0.00037818597,0.000016531452,0.00048919435,0.001433469,0.006345031,0.00501556,0.36830133,0.61696094,0.000060860002],"about_ca_topic_score_codex":0.00096513587,"about_ca_topic_score_gemma":0.0010367221,"teacher_disagreement_score":0.02937423,"about_ca_system_score_codex":0.002321597,"about_ca_system_score_gemma":0.005099475,"threshold_uncertainty_score":0.0982666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024143185,0.000088477624,0.9920826,0.00022196546,0.000052430103,0.000048900023,0.00008088473,0.0020344788,0.002975941],"genre_scores_gemma":[0.093465306,0.00039895435,0.89307237,0.00047227746,0.00013075696,0.00028187074,0.0002351485,0.0017606737,0.010182625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939507,0.0012976181,0.0008283336,0.0011019633,0.0020474705,0.0007738577],"domain_scores_gemma":[0.9915529,0.0031107462,0.0005442167,0.0035330094,0.00095023756,0.00030894743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009844448,0.0010178233,0.0013163339,0.0015230378,0.0018202541,0.0060881977,0.0053344793,0.0018770876,0.008411816],"category_scores_gemma":[0.011792227,0.0018633788,0.0029432157,0.0020083762,0.0061184764,0.017321615,0.00915558,0.00503298,0.002741501],"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.000046294095,0.000026241687,0.0004656932,0.00014443518,0.000019765053,0.00015129865,0.0007399695,0.002071777,0.0029289774,0.96549445,0.0017151865,0.026195757],"study_design_scores_gemma":[0.00007597628,0.0000927035,0.0002271759,0.00015610029,0.00014305291,0.0006146949,0.00029503694,0.036391366,0.029052565,0.8047749,0.12805064,0.00012589147],"about_ca_topic_score_codex":0.0026624962,"about_ca_topic_score_gemma":0.0032382016,"teacher_disagreement_score":0.009844448,"about_ca_system_score_codex":0.0020081725,"about_ca_system_score_gemma":0.0034474602,"threshold_uncertainty_score":0.052063048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006523085,0.000104459614,0.98738676,0.000075705844,0.000051107247,0.00011299475,0.00008434425,0.0024274227,0.0032341015],"genre_scores_gemma":[0.09003377,0.00044417783,0.8966177,0.00016361002,0.000058269055,0.00047768094,0.0007888617,0.0031166272,0.008299363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822813,0.00048816242,0.00020014858,0.000213015,0.0007343438,0.00013616132],"domain_scores_gemma":[0.99785453,0.0010774813,0.00013965316,0.00035202337,0.00047837343,0.00009781454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019220198,0.0006885953,0.00063101965,0.0006043686,0.00080622494,0.0023811134,0.002050693,0.0006896007,0.0064552333],"category_scores_gemma":[0.004180328,0.0009995921,0.0013310557,0.00044422026,0.0006250735,0.0051146536,0.0017805166,0.002090736,0.002011301],"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.00070105365,0.00037907797,0.0024734067,0.002234079,0.0003129955,0.0015499624,0.005919883,0.13310814,0.115035415,0.198297,0.022509696,0.51747924],"study_design_scores_gemma":[0.00022045357,0.00047809628,0.0008199613,0.00035366663,0.0002598113,0.0012150812,0.0005989789,0.45959777,0.083134435,0.062420055,0.3907322,0.00016939215],"about_ca_topic_score_codex":0.0019337384,"about_ca_topic_score_gemma":0.0019424009,"teacher_disagreement_score":0.0064552333,"about_ca_system_score_codex":0.0007164372,"about_ca_system_score_gemma":0.0014659936,"threshold_uncertainty_score":0.021594942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00098889,0.00006783775,0.99684334,0.000065778004,0.000021238551,0.000058992944,0.000092026894,0.00077971123,0.0010822255],"genre_scores_gemma":[0.056610987,0.0005221029,0.9392241,0.0001306088,0.00004518883,0.00026147842,0.00050140935,0.0005379108,0.0021661997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610186,0.0010349449,0.000349974,0.00060290715,0.0017072287,0.00020312684],"domain_scores_gemma":[0.9953081,0.0030230244,0.00026275465,0.0006142019,0.0007281641,0.00006372571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443804,0.0017038431,0.0013245927,0.0030232465,0.0010920833,0.0037368524,0.0019426655,0.0010246041,0.008063818],"category_scores_gemma":[0.008767108,0.0011012108,0.0028695604,0.0020289256,0.0019553923,0.005200544,0.002332012,0.002857478,0.0015996639],"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.00026234836,0.00008637081,0.0009895165,0.0007501561,0.00015242644,0.00023087293,0.00045966898,0.21997248,0.0077291867,0.5605205,0.0052918755,0.20355469],"study_design_scores_gemma":[0.00008514996,0.00007864981,0.000136425,0.00015873674,0.000099217985,0.0001669432,0.00011771253,0.5137652,0.019207217,0.4166424,0.04947909,0.00006327355],"about_ca_topic_score_codex":0.0045516114,"about_ca_topic_score_gemma":0.0043474585,"teacher_disagreement_score":0.008063818,"about_ca_system_score_codex":0.0017892953,"about_ca_system_score_gemma":0.002071286,"threshold_uncertainty_score":0.026976168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018134372,0.000557774,0.84746814,0.00054097467,0.0003962485,0.0001864731,0.0012621763,0.104672045,0.026781779],"genre_scores_gemma":[0.15957686,0.0006383786,0.80031806,0.00069897994,0.00016177323,0.0005995405,0.003497861,0.026185874,0.00832274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99485636,0.0009915292,0.00045821554,0.00083425886,0.0025380047,0.00032160012],"domain_scores_gemma":[0.9876195,0.0046263766,0.0008681338,0.003567504,0.0029621955,0.0003563038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022520456,0.0011835666,0.00078025076,0.0013004254,0.0007400478,0.0026814956,0.0022696846,0.0010569195,0.006513146],"category_scores_gemma":[0.019578677,0.0006484922,0.00091826316,0.002492806,0.0010811177,0.0028042851,0.0017558952,0.0023311945,0.0074896067],"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.0015934536,0.000677397,0.008467575,0.001892465,0.0002252818,0.0008870448,0.00084254984,0.07121905,0.13703442,0.056397326,0.087062985,0.6337004],"study_design_scores_gemma":[0.00044450132,0.00039412026,0.0057251947,0.00047179876,0.00009831686,0.0011733453,0.00017731091,0.45827016,0.23843153,0.07534167,0.21920618,0.00026583223],"about_ca_topic_score_codex":0.0026771217,"about_ca_topic_score_gemma":0.0021489135,"teacher_disagreement_score":0.006513146,"about_ca_system_score_codex":0.00087692,"about_ca_system_score_gemma":0.0019348467,"threshold_uncertainty_score":0.021788657},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069017266,0.01885292,0.13716,0.049154356,0.0675842,0.00052155176,0.0031543549,0.014023721,0.70264715],"genre_scores_gemma":[0.0099810725,0.008457616,0.034049045,0.003068593,0.0036589624,0.00027540114,0.0042713564,0.0022730047,0.93396497],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790907,0.00021807622,0.000087786255,0.00029769787,0.0012572007,0.00023018155],"domain_scores_gemma":[0.9953408,0.00040772746,0.0000964512,0.00042728207,0.0027523914,0.00097527157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040598195,0.001164006,0.0006498744,0.0021632893,0.0015973633,0.0054260967,0.0018783933,0.0031894678,0.16196662],"category_scores_gemma":[0.0059346575,0.0005672973,0.00063380104,0.0011149049,0.00066746364,0.0031924937,0.0021405607,0.0025836993,0.11758566],"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.000052243406,0.000051613773,0.00019841021,0.00006570061,0.000003366649,0.00010123969,0.000062578176,0.00014463479,0.00082518044,0.005427178,0.83570135,0.15736653],"study_design_scores_gemma":[0.0000071293543,0.000019811883,0.00011057762,0.000047258585,0.000002546604,0.00012009281,0.000028832006,0.00034923665,0.0003484869,0.0006091315,0.9983505,0.000006488708],"about_ca_topic_score_codex":0.0068724817,"about_ca_topic_score_gemma":0.014219497,"teacher_disagreement_score":0.16196662,"about_ca_system_score_codex":0.0018050281,"about_ca_system_score_gemma":0.0033116639,"threshold_uncertainty_score":0.5418323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020567114,0.000048352384,0.9771682,0.000092756,0.000012437451,0.000110837835,0.000056596444,0.0015351232,0.0004085908],"genre_scores_gemma":[0.4426396,0.00013678068,0.5551521,0.00011866419,0.000037799455,0.00035391498,0.00028708327,0.0004697236,0.00080430123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915895,0.0022173342,0.00079610513,0.0018859007,0.002752066,0.0007591147],"domain_scores_gemma":[0.97376233,0.018195089,0.0022281657,0.0041529476,0.001320885,0.00034055108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082833255,0.0015390797,0.0011949969,0.0011861484,0.0012165108,0.0031193085,0.0034176153,0.0013430185,0.0019793522],"category_scores_gemma":[0.027945954,0.0018575646,0.003896958,0.0008802673,0.0052489103,0.00881295,0.0040049125,0.0024057638,0.0002982637],"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.0006570815,0.00028948954,0.006223932,0.0008268927,0.0003777957,0.0012798484,0.0017515632,0.60198855,0.046718206,0.22555105,0.0009375241,0.11339802],"study_design_scores_gemma":[0.00014645567,0.00011964711,0.00038857458,0.00006348535,0.00012721037,0.0001609859,0.00008948882,0.869208,0.032782514,0.09426362,0.0025994596,0.000050593793],"about_ca_topic_score_codex":0.005567364,"about_ca_topic_score_gemma":0.004382967,"teacher_disagreement_score":0.0082833255,"about_ca_system_score_codex":0.0025037252,"about_ca_system_score_gemma":0.0038166596,"threshold_uncertainty_score":0.04380697},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018255288,0.00033757812,0.9384209,0.00074468186,0.0004332531,0.00012606052,0.0004079775,0.029115785,0.012158518],"genre_scores_gemma":[0.20654859,0.0004034938,0.7739446,0.000715247,0.00018503689,0.0001910142,0.0005570854,0.0050969804,0.01235793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989027,0.00021354106,0.00010425686,0.00014310447,0.000512908,0.00012343013],"domain_scores_gemma":[0.9986319,0.000424777,0.00008174259,0.00051395036,0.00027108833,0.00007654979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015174219,0.00026701728,0.00039044564,0.00053588883,0.00069535506,0.0014933925,0.0010336029,0.00057238154,0.0036421397],"category_scores_gemma":[0.0036427735,0.00054595195,0.00094208575,0.00043272512,0.0011840741,0.0022127936,0.0013551972,0.0014081213,0.0019025684],"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.00039972638,0.0002040931,0.0017301561,0.00073104445,0.000077229735,0.0009466632,0.0017215562,0.03403342,0.039345168,0.53732216,0.031076642,0.3524122],"study_design_scores_gemma":[0.0003159756,0.00028750297,0.00081637816,0.00025203644,0.00008872287,0.0011013749,0.00020446672,0.14056627,0.10296031,0.51529497,0.23792332,0.00018867389],"about_ca_topic_score_codex":0.0008904252,"about_ca_topic_score_gemma":0.0011903645,"teacher_disagreement_score":0.0036421397,"about_ca_system_score_codex":0.0006636907,"about_ca_system_score_gemma":0.0017360887,"threshold_uncertainty_score":0.012184203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026265515,0.0011195935,0.95437676,0.0004522243,0.00026630494,0.000094207644,0.0003425267,0.0011494157,0.015933346],"genre_scores_gemma":[0.67872953,0.0012792067,0.30836433,0.0003798887,0.00021507572,0.00021453755,0.0005000322,0.0004284303,0.009888899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984723,0.00029691975,0.000108141205,0.00029666105,0.0005849003,0.00024104645],"domain_scores_gemma":[0.99560624,0.0019926503,0.00035517866,0.0013004912,0.00049352087,0.0002519252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013064208,0.0007727082,0.00055030966,0.0006151449,0.0008026804,0.0015411269,0.00178761,0.00046380277,0.0037544006],"category_scores_gemma":[0.0055656373,0.00038960238,0.00048069062,0.0006868918,0.0014459334,0.0021317585,0.0015574612,0.0015147806,0.0006861443],"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.00028486588,0.00006506851,0.00082000264,0.00022201167,0.000029120123,0.00016003869,0.00022053074,0.15831892,0.014061241,0.7669447,0.0038544612,0.05501906],"study_design_scores_gemma":[0.000062184714,0.00011373952,0.00016473969,0.00004256796,0.0000411733,0.00015826705,0.00003642715,0.463875,0.012806431,0.48357794,0.039089307,0.00003225399],"about_ca_topic_score_codex":0.002059698,"about_ca_topic_score_gemma":0.0022026028,"teacher_disagreement_score":0.0037544006,"about_ca_system_score_codex":0.0019075068,"about_ca_system_score_gemma":0.0019667542,"threshold_uncertainty_score":0.01384002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21852489,0.007289123,0.6415781,0.0068770642,0.0018553904,0.00044677075,0.00023061248,0.003736605,0.1194614],"genre_scores_gemma":[0.5983551,0.0024837765,0.36531636,0.0016857713,0.00032739204,0.00029495376,0.00014537538,0.0007215189,0.030669713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994955,0.00013403417,0.0000604714,0.00005147101,0.0001697451,0.00008860376],"domain_scores_gemma":[0.99922097,0.0002327862,0.000081989325,0.00010401316,0.00031266996,0.00004755634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012553422,0.00039014238,0.00023669911,0.00050474954,0.0005316034,0.001962543,0.0005502318,0.0005150113,0.0018747529],"category_scores_gemma":[0.0025244711,0.000561188,0.0003893935,0.00061957905,0.00067522447,0.0017982792,0.0005811146,0.0015977406,0.00071226235],"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.00087327696,0.00012458191,0.005823399,0.0008228199,0.00006876793,0.0011115868,0.0015699344,0.093055055,0.112664945,0.45216644,0.009800222,0.321919],"study_design_scores_gemma":[0.00021464194,0.0016685345,0.006348169,0.00059889926,0.000373569,0.0014401318,0.0010463024,0.18953176,0.10618045,0.18011771,0.51230067,0.00017916875],"about_ca_topic_score_codex":0.00109012,"about_ca_topic_score_gemma":0.003080983,"teacher_disagreement_score":0.001962543,"about_ca_system_score_codex":0.00062472565,"about_ca_system_score_gemma":0.0015820083,"threshold_uncertainty_score":0.0066390038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016554384,0.00035687015,0.9580816,0.00031450493,0.00032185848,0.00025211673,0.00023444081,0.007858818,0.016025385],"genre_scores_gemma":[0.5569276,0.00072252733,0.41691855,0.0003600981,0.00033355062,0.0006054666,0.00081769604,0.0020843297,0.021230225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760854,0.000706039,0.00017828835,0.00050056115,0.0007328525,0.00027375206],"domain_scores_gemma":[0.9966808,0.0009356748,0.00027736922,0.0015786315,0.0003976887,0.00012983319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648848,0.0008696471,0.00079210044,0.00096071936,0.0009830887,0.0019385288,0.0013212664,0.0007502403,0.008861914],"category_scores_gemma":[0.00579852,0.00048860663,0.00061202503,0.0011618271,0.0013982694,0.0025190148,0.002332144,0.0012686453,0.0021897971],"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.00075564435,0.0002717347,0.0031239686,0.0005561688,0.00018779731,0.00044599664,0.0012182904,0.13947912,0.050164316,0.35613236,0.028328665,0.41933593],"study_design_scores_gemma":[0.00024434636,0.0003586569,0.0009459963,0.00009341244,0.00011477814,0.00034475254,0.00021526054,0.50683737,0.058543973,0.29352516,0.13866797,0.00010832665],"about_ca_topic_score_codex":0.0021371474,"about_ca_topic_score_gemma":0.002280964,"teacher_disagreement_score":0.008861914,"about_ca_system_score_codex":0.0010190508,"about_ca_system_score_gemma":0.0021547743,"threshold_uncertainty_score":0.029646099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9431502,0.0013970562,0.044907946,0.00046495954,0.000028961867,0.00027411277,0.00032100728,0.000261673,0.0091940835],"genre_scores_gemma":[0.9627585,0.0008506735,0.033899516,0.00007805239,0.00004445366,0.00023861697,0.00061873085,0.0002212686,0.0012902415],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9426159,0.028989628,0.00560641,0.004556408,0.016981216,0.0012503765],"domain_scores_gemma":[0.32318175,0.57010025,0.034614008,0.045658037,0.024826651,0.001619218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.054170065,0.0008161814,0.0006377675,0.0033591012,0.00097140396,0.0029745477,0.0024022942,0.0013663071,0.0020935356],"category_scores_gemma":[0.35832494,0.0009718835,0.0007442417,0.0041187545,0.0034799154,0.008017465,0.0032539198,0.0016567366,0.00058578164],"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.0025557366,0.0034438455,0.50375456,0.0029726673,0.00096390833,0.00073891564,0.009166844,0.0427984,0.007792189,0.03641922,0.0033841785,0.38600945],"study_design_scores_gemma":[0.0006434265,0.0123264035,0.6111955,0.0016844075,0.0020641927,0.004881279,0.015996201,0.2272279,0.041664694,0.0413194,0.04064656,0.00035002982],"about_ca_topic_score_codex":0.0007994572,"about_ca_topic_score_gemma":0.0014127546,"teacher_disagreement_score":0.054170065,"about_ca_system_score_codex":0.0012711345,"about_ca_system_score_gemma":0.00096567353,"threshold_uncertainty_score":0.2864821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017984217,0.00008439709,0.9734561,0.00020513138,0.00005076327,0.00011208139,0.00011491727,0.004809021,0.0031833486],"genre_scores_gemma":[0.44040075,0.00023928814,0.54837817,0.0005828112,0.00018018043,0.00040920687,0.00045580592,0.003019627,0.006334098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99403846,0.0011468178,0.0003647561,0.0007859827,0.0029910272,0.0006729275],"domain_scores_gemma":[0.9890771,0.0042853625,0.0006110376,0.0043791267,0.0014998065,0.00014762634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032680768,0.0015646487,0.0013902534,0.0022838982,0.0011787394,0.0034297295,0.0035122177,0.001198064,0.0042863493],"category_scores_gemma":[0.015810547,0.0013707784,0.0022578288,0.0016958759,0.0024682153,0.0067917584,0.0045677484,0.0036276837,0.0013093686],"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.0010533638,0.00021191887,0.0039187004,0.00039650928,0.00019536098,0.00045469005,0.0008065783,0.2346834,0.029520283,0.4469466,0.0067248875,0.27508768],"study_design_scores_gemma":[0.00006710375,0.00014417688,0.00036985,0.00006133357,0.00013760552,0.0001344125,0.000086383996,0.6126601,0.0444533,0.33210388,0.009719243,0.000062660765],"about_ca_topic_score_codex":0.002177903,"about_ca_topic_score_gemma":0.0021231994,"teacher_disagreement_score":0.0042863493,"about_ca_system_score_codex":0.0013118677,"about_ca_system_score_gemma":0.0019855327,"threshold_uncertainty_score":0.01728344},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021068437,0.00013595218,0.9867801,0.00016252843,0.00010770027,0.00008543844,0.00014234873,0.007531522,0.0029475656],"genre_scores_gemma":[0.02730739,0.00015280633,0.963415,0.0002509107,0.00007123015,0.00015281652,0.0006431607,0.0014425454,0.0065641603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.00014214974,0.000101845544,0.0003121283,0.0003592222,0.000131361],"domain_scores_gemma":[0.9984877,0.0005155569,0.00006765609,0.000454973,0.00039581096,0.000078350655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001327,0.0013352425,0.001141701,0.001419201,0.0013895815,0.0023042185,0.0028415557,0.0014374885,0.010823564],"category_scores_gemma":[0.0035779695,0.00096729875,0.0015833299,0.001780249,0.0010775498,0.0040012226,0.0029802916,0.0025801065,0.0057896064],"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.00023947921,0.00025061928,0.0006134516,0.0004035156,0.0000812949,0.00035370784,0.0004961618,0.026692718,0.030273868,0.08314376,0.05172893,0.8057225],"study_design_scores_gemma":[0.00020441676,0.00016475866,0.00038518966,0.00009715562,0.00017183504,0.00083353254,0.00015169785,0.6944884,0.036109917,0.18217747,0.08508892,0.00012672726],"about_ca_topic_score_codex":0.0031747357,"about_ca_topic_score_gemma":0.0050626155,"teacher_disagreement_score":0.010823564,"about_ca_system_score_codex":0.0008968825,"about_ca_system_score_gemma":0.002582364,"threshold_uncertainty_score":0.03620845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008209796,0.0007316997,0.9713585,0.0005981201,0.00017304628,0.0001456986,0.00009951921,0.006491926,0.012191839],"genre_scores_gemma":[0.1504133,0.0007057722,0.83451915,0.00029944957,0.00023851579,0.0007363779,0.00047127597,0.0015908555,0.011025288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984585,0.00052263436,0.000104932325,0.0001730705,0.0006105744,0.00013025531],"domain_scores_gemma":[0.99802643,0.00069306593,0.00013918361,0.00081152073,0.00023235475,0.0000973803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014794968,0.0006282188,0.0004672621,0.00042584218,0.00092267536,0.0017763426,0.0018714953,0.0005167454,0.0057198782],"category_scores_gemma":[0.004350062,0.0004723631,0.00062873994,0.0009141955,0.0011628501,0.0021688216,0.002288304,0.001418343,0.0016315876],"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.000170872,0.000087679815,0.0017000864,0.0005493206,0.00012384992,0.00044095458,0.00071318954,0.08467967,0.01278391,0.6301865,0.03505118,0.23351276],"study_design_scores_gemma":[0.00016260568,0.00012809134,0.0007181365,0.00011896009,0.00006211555,0.00035063873,0.0001462135,0.35238618,0.014766581,0.3967181,0.23439579,0.000046508467],"about_ca_topic_score_codex":0.0010153344,"about_ca_topic_score_gemma":0.0016992084,"teacher_disagreement_score":0.0057198782,"about_ca_system_score_codex":0.0008702982,"about_ca_system_score_gemma":0.0017715201,"threshold_uncertainty_score":0.01913488},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025618773,0.0000646058,0.96320605,0.000038475595,0.000039969316,0.00012077806,0.00016110492,0.008565586,0.002184563],"genre_scores_gemma":[0.23427093,0.0001670405,0.75203377,0.00009482836,0.000016693484,0.000330178,0.00097484095,0.006673622,0.0054381215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811906,0.00032540792,0.00022072718,0.0003107428,0.0008278671,0.00019615747],"domain_scores_gemma":[0.9966518,0.0014519268,0.00027297463,0.0010686659,0.00047755538,0.0000770542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022968047,0.00092913874,0.0006810033,0.0007966715,0.00051554176,0.0018258048,0.0015863456,0.00080365536,0.003881153],"category_scores_gemma":[0.0061396053,0.0008998969,0.001544402,0.0005658349,0.001291072,0.0020217386,0.002085368,0.0014732806,0.0012389071],"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.0010013762,0.0003169352,0.006747413,0.0016034567,0.0002627761,0.0019847576,0.0033454816,0.17433292,0.2814419,0.1427249,0.009692021,0.37654606],"study_design_scores_gemma":[0.00018402298,0.00045348745,0.0011189178,0.00013233509,0.0001929303,0.0009990763,0.000403559,0.4450767,0.4331226,0.03156848,0.08658399,0.00016394805],"about_ca_topic_score_codex":0.0013147134,"about_ca_topic_score_gemma":0.0013715455,"teacher_disagreement_score":0.003881153,"about_ca_system_score_codex":0.00079269015,"about_ca_system_score_gemma":0.0012928791,"threshold_uncertainty_score":0.012983739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03863018,0.0014132782,0.8998478,0.0006815958,0.00046361398,0.00023918826,0.0002308679,0.0390906,0.0194029],"genre_scores_gemma":[0.23088807,0.0014711951,0.74389195,0.0006501648,0.0002594925,0.00023179066,0.0012806442,0.013780989,0.0075457017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965706,0.00059903867,0.00028768432,0.0004998544,0.0017261882,0.0003166345],"domain_scores_gemma":[0.99589914,0.0015636164,0.00037305293,0.0010666737,0.0009761756,0.000121382436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026023474,0.0010004229,0.0005692293,0.0009710305,0.0006015905,0.0019935083,0.0017872544,0.0009734877,0.0027218033],"category_scores_gemma":[0.009337042,0.0011518225,0.0012119684,0.0007652773,0.0010322138,0.0032459698,0.0015143299,0.0025389486,0.0017001705],"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.000890039,0.0002709116,0.006672416,0.0015680777,0.0002942227,0.0007745953,0.0012464626,0.0676478,0.23234558,0.07525861,0.036540188,0.57649106],"study_design_scores_gemma":[0.00031643882,0.00041332003,0.003310272,0.0002903349,0.00045649047,0.0016408217,0.00028742538,0.45678037,0.17023994,0.07419264,0.29190195,0.00016998951],"about_ca_topic_score_codex":0.0011981959,"about_ca_topic_score_gemma":0.001729905,"teacher_disagreement_score":0.0027218033,"about_ca_system_score_codex":0.0006011532,"about_ca_system_score_gemma":0.0014334857,"threshold_uncertainty_score":0.0137627125},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021505514,0.22734296,0.0057140375,0.5458356,0.07020651,0.000039233182,0.0004557824,0.00034159093,0.14791368],"genre_scores_gemma":[0.08783819,0.36081246,0.008898851,0.14347576,0.079598464,0.00014476254,0.0011596625,0.00040695406,0.31766492],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803907,0.00094185176,0.00006292703,0.00018458896,0.00041714203,0.00035449074],"domain_scores_gemma":[0.9912487,0.0032153241,0.00028079227,0.0005878167,0.001705553,0.0029618049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005919279,0.00066308695,0.00065006304,0.001356427,0.002805207,0.0076741087,0.0012517811,0.006529616,0.10152096],"category_scores_gemma":[0.007622991,0.00030554752,0.0006119419,0.0015229456,0.004825898,0.009394759,0.0037857038,0.005876192,0.025694845],"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.0002366025,0.00004766227,0.0005724888,0.0010372367,0.000014238901,0.0002021739,0.00050136587,0.00026460143,0.0008998349,0.094544254,0.71193165,0.1897479],"study_design_scores_gemma":[0.000009689914,0.000028866814,0.0004042043,0.0006894579,0.000009584908,0.00012961289,0.0007241495,0.00010068765,0.00013986308,0.050858185,0.9468894,0.000016302225],"about_ca_topic_score_codex":0.0035185649,"about_ca_topic_score_gemma":0.0062010684,"teacher_disagreement_score":0.10152096,"about_ca_system_score_codex":0.0022679693,"about_ca_system_score_gemma":0.0057352963,"threshold_uncertainty_score":0.33962142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070936605,0.00014173519,0.98490715,0.00029304565,0.000038845774,0.000067994915,0.00007525231,0.00096588803,0.006416413],"genre_scores_gemma":[0.3163024,0.0004509414,0.6704981,0.00042507832,0.000101768186,0.00032030494,0.00033397923,0.0008714845,0.010696023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972224,0.0008309342,0.00025073512,0.00048568874,0.0009360057,0.00027415203],"domain_scores_gemma":[0.9968029,0.0010687642,0.0001876075,0.0011146985,0.00069934165,0.00012671408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032639182,0.00068495295,0.0004117246,0.0010880522,0.00089685724,0.0021660095,0.0021183789,0.001164904,0.004933053],"category_scores_gemma":[0.0046070064,0.0007331382,0.001980794,0.0008411826,0.0030826896,0.0059258034,0.0040270523,0.0026859909,0.0010265025],"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.000029901703,0.000016303353,0.00020275317,0.00007142042,0.000010687618,0.00009780297,0.0005061263,0.0070941243,0.003567109,0.9724755,0.00061463565,0.015313475],"study_design_scores_gemma":[0.000029424913,0.00005274407,0.00012301408,0.00005169082,0.00003821309,0.00013595514,0.00013074541,0.045066074,0.0077830157,0.9092013,0.037356403,0.000031396707],"about_ca_topic_score_codex":0.0019101368,"about_ca_topic_score_gemma":0.0024329938,"teacher_disagreement_score":0.004933053,"about_ca_system_score_codex":0.0015950424,"about_ca_system_score_gemma":0.0014755452,"threshold_uncertainty_score":0.017261446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050583478,0.00063051976,0.9235119,0.0021938318,0.00022043903,0.000097549535,0.00020091522,0.0016406653,0.020920653],"genre_scores_gemma":[0.73988503,0.00071666157,0.24067745,0.0010416303,0.00026347075,0.00025339695,0.0002930485,0.0013773609,0.015492006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98867035,0.0028794836,0.0008370566,0.0022271902,0.0043083234,0.0010775771],"domain_scores_gemma":[0.9722153,0.013568927,0.0018811488,0.008046498,0.0034239895,0.0008642357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008616839,0.0008772798,0.0009559637,0.0019086546,0.002233511,0.0055236383,0.0021325508,0.0018374589,0.005435162],"category_scores_gemma":[0.041621782,0.0018287026,0.0024774417,0.0012753292,0.010745509,0.017940065,0.010278416,0.0062340354,0.00093047833],"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.00007010212,0.000013031471,0.0008338376,0.000074184594,0.000032458305,0.00020983246,0.0012719351,0.0073498073,0.0014736305,0.9753838,0.0008603213,0.012426971],"study_design_scores_gemma":[0.000021106125,0.00002891244,0.0002248063,0.000057337005,0.000051907617,0.0001600034,0.00026983474,0.020453824,0.0029831657,0.9627901,0.012912194,0.000046807854],"about_ca_topic_score_codex":0.0037175068,"about_ca_topic_score_gemma":0.0029116992,"teacher_disagreement_score":0.008616839,"about_ca_system_score_codex":0.0025111816,"about_ca_system_score_gemma":0.0019028826,"threshold_uncertainty_score":0.04557073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023647416,0.0001249014,0.99056983,0.00018114752,0.00007132343,0.0000974647,0.00006965209,0.0023807057,0.004140253],"genre_scores_gemma":[0.07810138,0.0004575026,0.9026194,0.000583488,0.00014028868,0.0006107786,0.00031797081,0.0024498221,0.014719385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595696,0.0005258329,0.0003993963,0.0007449593,0.0017967607,0.00057604763],"domain_scores_gemma":[0.99340993,0.0018932772,0.0004373847,0.0027212368,0.0013125238,0.00022567753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024048244,0.0008460822,0.0008021631,0.0009897433,0.0019832274,0.0029814255,0.004126574,0.0012346514,0.012464171],"category_scores_gemma":[0.0083907945,0.0011593153,0.0013910785,0.0017632288,0.002694538,0.007194694,0.00480183,0.0047670216,0.0045069847],"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.00028648594,0.00011767084,0.00061987044,0.00058910943,0.0000503409,0.00015703928,0.0010112417,0.011007719,0.047472678,0.76703644,0.010809934,0.16084155],"study_design_scores_gemma":[0.00020808514,0.00026584385,0.00034700654,0.00022459344,0.00012307726,0.00086490065,0.00031194944,0.11966343,0.099213265,0.52545583,0.25318474,0.00013722864],"about_ca_topic_score_codex":0.0036493558,"about_ca_topic_score_gemma":0.0045705023,"teacher_disagreement_score":0.012464171,"about_ca_system_score_codex":0.0015514621,"about_ca_system_score_gemma":0.0034294755,"threshold_uncertainty_score":0.041696787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014491234,0.0006281919,0.9678793,0.0026148593,0.00033705615,0.000037309193,0.000056556226,0.0005165907,0.013438927],"genre_scores_gemma":[0.69700515,0.0012333413,0.2916564,0.0010954186,0.0006331027,0.00026246722,0.00011924652,0.00050675636,0.0074881203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716836,0.0011648057,0.00020262285,0.0003326856,0.0008916527,0.00023979499],"domain_scores_gemma":[0.99621385,0.002117289,0.00021498687,0.00068959227,0.0005682339,0.0001959979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044361404,0.00071351515,0.0006838095,0.001640882,0.0017532068,0.004594049,0.0017957473,0.0013458584,0.002857353],"category_scores_gemma":[0.008598492,0.0005572583,0.0017190883,0.0011991588,0.01046632,0.01105729,0.00425448,0.003706633,0.0005149885],"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.000003097857,0.000005470481,0.000022506943,0.0000119351325,0.0000025341328,0.000012739899,0.00012389767,0.0012177778,0.00022144456,0.9968039,0.00010213924,0.001472596],"study_design_scores_gemma":[0.0000044178987,0.0000050319823,0.000013135734,0.00000769019,0.0000024566407,0.000010282958,0.000026816886,0.006788996,0.00036731552,0.9898335,0.0029336088,0.000006837559],"about_ca_topic_score_codex":0.0019207278,"about_ca_topic_score_gemma":0.0011177757,"teacher_disagreement_score":0.004594049,"about_ca_system_score_codex":0.0034276,"about_ca_system_score_gemma":0.0022176323,"threshold_uncertainty_score":0.024869084},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008248459,0.0028719197,0.7720183,0.0063998136,0.0015868658,0.00033366407,0.0023537232,0.0524232,0.15376408],"genre_scores_gemma":[0.15405817,0.004859112,0.5992501,0.006632909,0.0009370803,0.001139608,0.006077807,0.023816613,0.20322864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979518,0.0005014775,0.00010075701,0.00046472927,0.00076040474,0.00022084157],"domain_scores_gemma":[0.997821,0.00090386334,0.00012445799,0.00050280854,0.0004791527,0.00016884835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021722824,0.00073717494,0.0007017225,0.0010451474,0.0013737018,0.0028457337,0.0023517958,0.0012974334,0.056026157],"category_scores_gemma":[0.006767924,0.0006574901,0.0013307134,0.00096276967,0.0018967116,0.0072167264,0.0030554917,0.0038899821,0.017729722],"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.00023998093,0.000075926335,0.00044034596,0.0004962458,0.000031819898,0.00013714316,0.00039722846,0.0029705148,0.0038539602,0.6988522,0.1464414,0.14606324],"study_design_scores_gemma":[0.000061374136,0.00008935992,0.00026038487,0.00020071497,0.00003068392,0.00035116624,0.000055165412,0.022083905,0.008519809,0.32386425,0.64440936,0.00007380653],"about_ca_topic_score_codex":0.0012876538,"about_ca_topic_score_gemma":0.0017749878,"teacher_disagreement_score":0.056026157,"about_ca_system_score_codex":0.0011553285,"about_ca_system_score_gemma":0.0018344721,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043748826,0.00016623677,0.9412412,0.0007200401,0.00007666537,0.000058960595,0.000050971183,0.00096164463,0.012975397],"genre_scores_gemma":[0.6585565,0.0003684505,0.32432005,0.0005447764,0.00017975167,0.00019045423,0.00016596653,0.0012871997,0.014386767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569005,0.0012699483,0.0003181249,0.0007390837,0.0015136605,0.00046918172],"domain_scores_gemma":[0.9918325,0.0027653892,0.0006682382,0.003670767,0.00088979927,0.0001732535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004629674,0.00055949116,0.00048791894,0.0008728377,0.0012147033,0.0030067305,0.0014307424,0.0009907066,0.002163976],"category_scores_gemma":[0.009318936,0.00070868875,0.0013549803,0.0007707891,0.006716341,0.007162409,0.0050606276,0.0041088737,0.00060217245],"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.000034080553,0.000018082394,0.0009362852,0.000043779663,0.000014532924,0.00008485582,0.0009180593,0.00480829,0.00359699,0.97760814,0.00034223258,0.011594694],"study_design_scores_gemma":[0.000027050728,0.000081886814,0.00043725042,0.00005896084,0.00005595695,0.00023544382,0.00015124248,0.028842406,0.014210464,0.92964077,0.026204433,0.000054024866],"about_ca_topic_score_codex":0.0014935269,"about_ca_topic_score_gemma":0.0014994843,"teacher_disagreement_score":0.004629674,"about_ca_system_score_codex":0.0013748333,"about_ca_system_score_gemma":0.0019321302,"threshold_uncertainty_score":0.024484336},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015869915,0.00017361491,0.96861935,0.00065236894,0.00013635785,0.0001757888,0.0006925925,0.0108924,0.0027875435],"genre_scores_gemma":[0.40247914,0.00047578264,0.5827797,0.0021044582,0.00045043146,0.0004763247,0.0036113488,0.0038422083,0.00378061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98152614,0.0042418023,0.0019487395,0.002581471,0.007929556,0.0017722675],"domain_scores_gemma":[0.95953095,0.02600263,0.0018864196,0.006946812,0.005128226,0.0005049972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009966806,0.0014973127,0.001394484,0.0020979973,0.0018740783,0.006338528,0.0053001675,0.0021876143,0.0066446685],"category_scores_gemma":[0.040175386,0.0019903139,0.005073568,0.0014844708,0.00589394,0.011226159,0.007248421,0.005280179,0.0014514087],"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.0005283144,0.0005880921,0.011278648,0.0016154166,0.00062908407,0.0018267733,0.0023597977,0.08672984,0.034417734,0.7038888,0.02181356,0.13432392],"study_design_scores_gemma":[0.0002660011,0.0002702359,0.0015608361,0.00023524583,0.0004147802,0.0007677229,0.00069054816,0.45550725,0.08311863,0.4349579,0.022016725,0.0001941127],"about_ca_topic_score_codex":0.010397191,"about_ca_topic_score_gemma":0.008623196,"teacher_disagreement_score":0.010397191,"about_ca_system_score_codex":0.00287519,"about_ca_system_score_gemma":0.0059835194,"threshold_uncertainty_score":0.052710116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33358034,0.0006049376,0.6430989,0.00041723443,0.00013432787,0.0003746516,0.00018716641,0.014090852,0.0075116204],"genre_scores_gemma":[0.7071478,0.00019485778,0.28920603,0.0001272794,0.00002976869,0.00023312417,0.00038238065,0.0006987992,0.0019799978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983797,0.00046854842,0.0001387602,0.00025914126,0.00053123274,0.000222502],"domain_scores_gemma":[0.9969348,0.0009762198,0.00019743541,0.0011837882,0.00050219195,0.0002055217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326346,0.0010982644,0.0006340366,0.0004973763,0.0007257927,0.0018947518,0.0034735205,0.0006165498,0.0027510538],"category_scores_gemma":[0.0055548116,0.0006947056,0.0006823003,0.0007289762,0.00093605183,0.0030371335,0.0024708114,0.0017826002,0.00055290194],"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.00513316,0.0014413736,0.012121368,0.00087323703,0.00047347342,0.00073186215,0.0015662779,0.30578706,0.17587404,0.043258894,0.014990851,0.43774843],"study_design_scores_gemma":[0.00021488525,0.00027485503,0.00075453875,0.000015303287,0.000041647872,0.00008396101,0.00013547564,0.94452786,0.040728997,0.009384742,0.0038126414,0.000025157862],"about_ca_topic_score_codex":0.004570483,"about_ca_topic_score_gemma":0.004653853,"teacher_disagreement_score":0.004570483,"about_ca_system_score_codex":0.0008110892,"about_ca_system_score_gemma":0.0013793167,"threshold_uncertainty_score":0.009203196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51464653,0.014552555,0.0997128,0.029548319,0.0005649351,0.00016092282,0.00023786866,0.00044912923,0.34012693],"genre_scores_gemma":[0.9901663,0.0009101122,0.005555923,0.0007299667,0.000059064652,0.000056219775,0.000035853744,0.00003216463,0.00245451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948881,0.0034521553,0.00012425322,0.0006879283,0.00039406863,0.00045344693],"domain_scores_gemma":[0.9959979,0.0022220588,0.00047896925,0.00048569692,0.00032462226,0.00049079733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020519188,0.0004870115,0.00034839395,0.0018343219,0.0035952728,0.0064689484,0.00077985565,0.0013709142,0.0035679128],"category_scores_gemma":[0.0052695856,0.00035762295,0.00024012008,0.0015464659,0.010001297,0.0068948893,0.00834264,0.0022663914,0.0004119598],"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.00016531849,0.000115775685,0.031227557,0.0007024384,0.000073973235,0.0031894206,0.18232378,0.00426019,0.004615585,0.62622535,0.0075349687,0.13956568],"study_design_scores_gemma":[0.00003645472,0.00018524785,0.021269454,0.00097398227,0.00008310451,0.0030721822,0.12269364,0.004681448,0.002822671,0.51262385,0.3314566,0.000101506565],"about_ca_topic_score_codex":0.002849247,"about_ca_topic_score_gemma":0.003934026,"teacher_disagreement_score":0.0064689484,"about_ca_system_score_codex":0.0020949645,"about_ca_system_score_gemma":0.0014626866,"threshold_uncertainty_score":0.015200138},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01413928,0.00009906596,0.9023485,0.00022435932,0.000106682164,0.00007376414,0.00031148345,0.07571826,0.0069785523],"genre_scores_gemma":[0.24031892,0.0003156019,0.69970095,0.0007553595,0.00009143913,0.00023051613,0.001128939,0.044308998,0.013149166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847156,0.00024086316,0.00015368182,0.00032926232,0.0006519077,0.00015275409],"domain_scores_gemma":[0.9943197,0.002675311,0.0003738579,0.0016760918,0.0008132603,0.00014181867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013630586,0.00089306437,0.00057630264,0.000517629,0.000518601,0.002531859,0.0020699638,0.0008153512,0.0059165466],"category_scores_gemma":[0.009455782,0.0008095668,0.00091324875,0.00052237866,0.0016001208,0.0036740657,0.0023744917,0.00219374,0.004405514],"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.0016072295,0.0003436903,0.0107770255,0.0010110264,0.00014216,0.002875478,0.0058312425,0.05873979,0.14377117,0.1973032,0.050727826,0.52687025],"study_design_scores_gemma":[0.00021396733,0.00020390889,0.0018091586,0.0003752165,0.0001054471,0.0013591269,0.0004897677,0.28197414,0.4089356,0.09263888,0.21167436,0.00022048838],"about_ca_topic_score_codex":0.0018117774,"about_ca_topic_score_gemma":0.0028264094,"teacher_disagreement_score":0.0059165466,"about_ca_system_score_codex":0.0009182167,"about_ca_system_score_gemma":0.0016870574,"threshold_uncertainty_score":0.019792795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7898573,0.00083224656,0.19205524,0.00082001166,0.000102915066,0.00025748415,0.00017701539,0.013434655,0.0024631151],"genre_scores_gemma":[0.9763257,0.000094742485,0.023132186,0.00003697686,0.000011147014,0.000021915544,0.0000476521,0.00006742073,0.00026225808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950262,0.0015218381,0.00025242468,0.0006824228,0.0017277525,0.00078934076],"domain_scores_gemma":[0.98527956,0.0037877543,0.002744361,0.005874668,0.0016866258,0.00062707387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003030672,0.00043312358,0.00067847554,0.0014101624,0.0009309053,0.0013059133,0.0016612245,0.0007348729,0.0005729101],"category_scores_gemma":[0.013505307,0.0005126083,0.00036770417,0.0013073978,0.0012088357,0.0031519963,0.0014953448,0.0010057483,0.00019756536],"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.0021255196,0.0008168497,0.1546476,0.00038328447,0.00018520697,0.0014222132,0.0019557464,0.17979318,0.07655512,0.012715004,0.0074483473,0.5619518],"study_design_scores_gemma":[0.00008274654,0.0005258419,0.028281039,0.00006328601,0.00007967696,0.0008120225,0.0006734115,0.89282674,0.06301462,0.009042098,0.004524187,0.000074326614],"about_ca_topic_score_codex":0.0073367925,"about_ca_topic_score_gemma":0.0034890932,"teacher_disagreement_score":0.0073367925,"about_ca_system_score_codex":0.0012797364,"about_ca_system_score_gemma":0.0022808763,"threshold_uncertainty_score":0.016027927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8922613,0.001059985,0.09867959,0.00023949437,0.00004046952,0.00015862465,0.000071576054,0.0047483994,0.0027404707],"genre_scores_gemma":[0.955503,0.00023353906,0.043114863,0.00008391562,0.000018561126,0.00010834144,0.000060840386,0.0002714112,0.0006055541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985959,0.0003120807,0.00016126763,0.00024180091,0.00047092943,0.00021801145],"domain_scores_gemma":[0.9905884,0.005436524,0.001677513,0.0015267638,0.000492185,0.0002785947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416263,0.00077118445,0.00044609717,0.0007901856,0.0005855801,0.0009884575,0.0014479471,0.000487975,0.0006398527],"category_scores_gemma":[0.009525229,0.00047342968,0.00025201077,0.0008901648,0.00064679823,0.0018675784,0.0008305581,0.0006024638,0.00022447779],"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.0012607193,0.000809317,0.015846485,0.00057567406,0.00007104817,0.00019460249,0.0010579501,0.05232768,0.76528764,0.0035648535,0.0008306607,0.15817335],"study_design_scores_gemma":[0.0002171605,0.0011621973,0.01773038,0.000051762265,0.00017706417,0.0003196119,0.00033595815,0.18911386,0.7802577,0.0037861294,0.006749544,0.00009862815],"about_ca_topic_score_codex":0.0014873629,"about_ca_topic_score_gemma":0.0032050246,"teacher_disagreement_score":0.0014873629,"about_ca_system_score_codex":0.0005816225,"about_ca_system_score_gemma":0.0010101786,"threshold_uncertainty_score":0.007490039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9200539,0.004024373,0.013495203,0.002632599,0.0008629273,0.00009406899,0.009079185,0.0017153225,0.04804249],"genre_scores_gemma":[0.98629737,0.00079172757,0.0022474646,0.00070863747,0.00007818968,0.000020068614,0.002682618,0.0001584511,0.007015559],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99952304,0.000051989497,0.000025083169,0.00009938521,0.00022880528,0.0000717206],"domain_scores_gemma":[0.99861455,0.00029138388,0.0002486017,0.00042226084,0.00032643374,0.00009682096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261378,0.0003972665,0.00045982283,0.0006157406,0.00076123874,0.0011329148,0.0003278883,0.000981321,0.0058452343],"category_scores_gemma":[0.0029853357,0.00022922506,0.00040001937,0.001251641,0.00042805847,0.00094508723,0.00038123157,0.0009006921,0.0013694272],"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.0016808042,0.00033326642,0.61039627,0.0008707494,0.001163724,0.0022446613,0.001665656,0.023876676,0.05859162,0.025846306,0.051877555,0.22145277],"study_design_scores_gemma":[0.00011158023,0.0011049195,0.725073,0.00028690562,0.00038494173,0.0040738895,0.001655411,0.013850078,0.04157608,0.014957908,0.19677569,0.00014955313],"about_ca_topic_score_codex":0.004305909,"about_ca_topic_score_gemma":0.007501185,"teacher_disagreement_score":0.0058452343,"about_ca_system_score_codex":0.00058340974,"about_ca_system_score_gemma":0.0003402556,"threshold_uncertainty_score":0.019554317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76803976,0.00030293714,0.19849294,0.00017027503,0.00006885903,0.0002046809,0.001155006,0.028465368,0.0031001582],"genre_scores_gemma":[0.93124247,0.00011638964,0.06456776,0.00009485069,0.000022370137,0.00010662886,0.0012574241,0.0013324535,0.0012595137],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997544,0.00045654966,0.00015627449,0.00040453576,0.0012194271,0.00021927209],"domain_scores_gemma":[0.98886883,0.0066271783,0.0010449267,0.00133825,0.001931004,0.00018979388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013989293,0.00087608566,0.00044009392,0.0016074813,0.00048051798,0.0008146158,0.0012191945,0.00063420285,0.0007957318],"category_scores_gemma":[0.009158387,0.00046228507,0.0006696625,0.001205372,0.00079221633,0.0009972502,0.0005140351,0.00066853256,0.00025086701],"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.0019293058,0.0010830328,0.12846062,0.0015334723,0.00039924958,0.0038941358,0.0026575283,0.17329325,0.38528594,0.015210059,0.009460085,0.2767933],"study_design_scores_gemma":[0.00006639163,0.00036498377,0.038670465,0.000065262415,0.00016795025,0.0006756239,0.00020216515,0.74097306,0.207427,0.005259587,0.0060290643,0.000098451725],"about_ca_topic_score_codex":0.0034365638,"about_ca_topic_score_gemma":0.0035199649,"teacher_disagreement_score":0.0034365638,"about_ca_system_score_codex":0.000905745,"about_ca_system_score_gemma":0.0012974977,"threshold_uncertainty_score":0.007398367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23339145,0.00033993612,0.63864446,0.000467723,0.0004069178,0.000644698,0.00021135295,0.114637196,0.011256231],"genre_scores_gemma":[0.6510752,0.00018870302,0.33090773,0.00039258038,0.00016210567,0.00041967808,0.00082154566,0.006082657,0.009949742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847883,0.000404855,0.00010907046,0.00035471257,0.00046056844,0.00019208332],"domain_scores_gemma":[0.99547833,0.00079935987,0.0003007096,0.002125932,0.00059403415,0.0007016382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020364202,0.0004742115,0.0006225301,0.0005197949,0.00048587413,0.0013614433,0.00265541,0.0007816565,0.0023532396],"category_scores_gemma":[0.0059874435,0.00057092187,0.00051177765,0.0002931433,0.0008206188,0.002525905,0.0025914758,0.0015217041,0.001516272],"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.0032052642,0.001214999,0.020657318,0.0005358617,0.00032494953,0.0023026855,0.0026505035,0.029391576,0.38106102,0.056219522,0.052621353,0.449815],"study_design_scores_gemma":[0.00038971123,0.0008920336,0.00796833,0.00012408754,0.00013037729,0.0011851894,0.00024484334,0.6239824,0.24437413,0.018988445,0.10150645,0.00021392142],"about_ca_topic_score_codex":0.00036775446,"about_ca_topic_score_gemma":0.00029739027,"teacher_disagreement_score":0.00265541,"about_ca_system_score_codex":0.0005654206,"about_ca_system_score_gemma":0.0007466496,"threshold_uncertainty_score":0.010769784},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012367833,0.00026752698,0.96988297,0.00049735507,0.00011475497,0.000142611,0.00042234903,0.0042394465,0.012065201],"genre_scores_gemma":[0.49273276,0.0007673462,0.48349905,0.0009777179,0.00035191272,0.00066983077,0.0013292122,0.0033604975,0.016311666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99194735,0.0011429307,0.0004072747,0.0016002789,0.003644374,0.0012578259],"domain_scores_gemma":[0.9877309,0.005232029,0.0009962787,0.0032276104,0.0025814509,0.00023177134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032345932,0.0012983134,0.0012372336,0.004511478,0.0028730102,0.0033508488,0.0025724862,0.0013922262,0.0075967438],"category_scores_gemma":[0.016101703,0.001268556,0.002555093,0.0022898668,0.0042172195,0.0063414993,0.0058458527,0.0037582442,0.0024061745],"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.00048641875,0.00020233737,0.009541548,0.000569882,0.0001597491,0.001148441,0.0015393323,0.035875645,0.02794195,0.6719609,0.010884722,0.23968905],"study_design_scores_gemma":[0.000050679617,0.000094928815,0.0015993806,0.00023562287,0.00023762426,0.0008895024,0.0002588385,0.14744346,0.056805916,0.73044944,0.061780196,0.00015443937],"about_ca_topic_score_codex":0.003787965,"about_ca_topic_score_gemma":0.0032487586,"teacher_disagreement_score":0.0075967438,"about_ca_system_score_codex":0.0021575799,"about_ca_system_score_gemma":0.003974565,"threshold_uncertainty_score":0.025413573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054854085,0.001762158,0.98227996,0.0011033661,0.00015790443,0.000021463915,0.000069430236,0.0011816164,0.007938644],"genre_scores_gemma":[0.41566238,0.006867862,0.5525218,0.0012233758,0.00067371165,0.00021817528,0.00036481823,0.001536677,0.02093115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971361,0.0007708845,0.00012887565,0.0004451972,0.0013255063,0.00019348096],"domain_scores_gemma":[0.9945109,0.003517212,0.0002894927,0.00095994753,0.00064211444,0.00008034123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016541902,0.0011193409,0.0011117767,0.0027897432,0.001101054,0.002399673,0.0024127364,0.0016003203,0.007493528],"category_scores_gemma":[0.013618083,0.00055966934,0.0013154428,0.0044655427,0.004988337,0.0077390345,0.002947743,0.0044309963,0.0019349894],"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.00006127587,0.000017518716,0.00036590622,0.00022307497,0.000025658845,0.00011575504,0.0002070867,0.034797344,0.0028700775,0.8549517,0.002829893,0.10353469],"study_design_scores_gemma":[0.0000161553,0.000027184871,0.00011861912,0.00007542809,0.000025695665,0.0001587776,0.000054895154,0.13408539,0.0051134573,0.8449514,0.015343634,0.000029395984],"about_ca_topic_score_codex":0.0032725672,"about_ca_topic_score_gemma":0.001924602,"teacher_disagreement_score":0.007493528,"about_ca_system_score_codex":0.0020685026,"about_ca_system_score_gemma":0.002496083,"threshold_uncertainty_score":0.025068343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011908645,0.00012940662,0.9902478,0.00046236804,0.00007439869,0.000054312037,0.0008462185,0.0045623947,0.0024321878],"genre_scores_gemma":[0.048745763,0.0005826445,0.9385434,0.0014030567,0.00019617488,0.00048413413,0.0022851962,0.0026014948,0.0051581715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809927,0.0004611494,0.00026852955,0.00031550633,0.00069631945,0.00015929193],"domain_scores_gemma":[0.99697626,0.0016757582,0.0002192951,0.00044657255,0.0005320586,0.00015006315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040190755,0.00093720347,0.00076489896,0.0013331186,0.0008015025,0.0041751144,0.0029182406,0.0010200178,0.0074377204],"category_scores_gemma":[0.00572398,0.001158452,0.0016314674,0.0012038614,0.0028665576,0.0056285914,0.0029351457,0.0048902673,0.0022494348],"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.00016449431,0.000090249756,0.000569924,0.00063731085,0.000041500338,0.00033480502,0.0013363521,0.025079943,0.007938704,0.813384,0.03929614,0.11112654],"study_design_scores_gemma":[0.00012177659,0.00009975571,0.00027280863,0.00030351657,0.000044835604,0.000548781,0.00029846007,0.11304911,0.017920395,0.548594,0.31862184,0.00012478791],"about_ca_topic_score_codex":0.002704967,"about_ca_topic_score_gemma":0.0038876035,"teacher_disagreement_score":0.0074377204,"about_ca_system_score_codex":0.001749552,"about_ca_system_score_gemma":0.0025687255,"threshold_uncertainty_score":0.024881601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017742325,0.0006470241,0.9566853,0.0009072392,0.00023487466,0.00011010108,0.0002279203,0.00089366926,0.022551624],"genre_scores_gemma":[0.42199814,0.0013700484,0.5500049,0.0007602291,0.00039256684,0.00047460018,0.00047726993,0.0005280449,0.02399418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956495,0.0012174677,0.00044746083,0.0009262987,0.001351368,0.00040782397],"domain_scores_gemma":[0.9935086,0.0024135695,0.0005227132,0.0020526329,0.0012346413,0.00026784872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054832436,0.00053189177,0.00047860146,0.0016185982,0.0018836001,0.0038781052,0.0016644069,0.0012581229,0.005587842],"category_scores_gemma":[0.010790266,0.0008539825,0.0016913596,0.001490708,0.005704928,0.009606521,0.004579749,0.0038716188,0.0016364324],"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.000009279328,0.0000030706326,0.00008219927,0.000019029054,0.0000024901294,0.000018692419,0.00023140475,0.00030769265,0.00037851193,0.99448544,0.00035271703,0.004109414],"study_design_scores_gemma":[0.000028498594,0.000034811077,0.00016275149,0.000045981047,0.000022393264,0.000141982,0.00010328169,0.005690011,0.002046231,0.9534268,0.038265496,0.000031879616],"about_ca_topic_score_codex":0.0011301403,"about_ca_topic_score_gemma":0.000966303,"teacher_disagreement_score":0.005587842,"about_ca_system_score_codex":0.0020443187,"about_ca_system_score_gemma":0.0017852759,"threshold_uncertainty_score":0.028998494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044951504,0.00059720606,0.98503834,0.0012999646,0.00014294518,0.00009722631,0.00018434659,0.0011907005,0.0069541796],"genre_scores_gemma":[0.22359286,0.001046825,0.7633991,0.0011716686,0.0004073704,0.000605779,0.0006035433,0.00096162985,0.008211275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905663,0.00328402,0.00074883073,0.0017871567,0.0030196388,0.0005940852],"domain_scores_gemma":[0.973598,0.017795194,0.0011249841,0.0048077274,0.0021405432,0.0005336044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078033446,0.0011060011,0.0010270008,0.0016742471,0.0024828329,0.004398747,0.0026480693,0.0011747283,0.011357928],"category_scores_gemma":[0.021419164,0.0013627387,0.0031654024,0.0012719211,0.0060883593,0.014339316,0.00831535,0.0069699944,0.0018059493],"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.000027627239,0.000023093353,0.00012239006,0.0001560907,0.000029774925,0.00008895748,0.00029330043,0.003816768,0.0009886957,0.979186,0.0015320564,0.013735276],"study_design_scores_gemma":[0.000021556963,0.000013730288,0.000035274425,0.000044347576,0.000016239353,0.00004309442,0.000038542155,0.015253359,0.0012999311,0.9695803,0.013641764,0.000011827131],"about_ca_topic_score_codex":0.0014241752,"about_ca_topic_score_gemma":0.0015047451,"teacher_disagreement_score":0.011357928,"about_ca_system_score_codex":0.0024873707,"about_ca_system_score_gemma":0.0027111406,"threshold_uncertainty_score":0.041268528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49067986,0.0049752216,0.46774969,0.0031171455,0.0002334161,0.00025232765,0.00023042638,0.012620786,0.020141084],"genre_scores_gemma":[0.9153665,0.00065329904,0.08117291,0.00043528044,0.00007608799,0.00005472959,0.0002265065,0.0008990799,0.0011155944],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9900372,0.0041310973,0.00036489585,0.0011475341,0.0033897616,0.0009294503],"domain_scores_gemma":[0.954698,0.022997716,0.0046537756,0.013321725,0.0034786195,0.0008501456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009070153,0.00090976944,0.00047175772,0.0012088974,0.0009914695,0.0035897426,0.0027290052,0.00089720264,0.0010819038],"category_scores_gemma":[0.039443135,0.00064249383,0.0005574052,0.0006899882,0.0022842165,0.0071477885,0.0040445933,0.003313624,0.00032749248],"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.0005455345,0.0004603378,0.055430092,0.00097170874,0.00021128204,0.0010975017,0.01971247,0.04541801,0.040087912,0.0729886,0.009188077,0.7538885],"study_design_scores_gemma":[0.000107087144,0.0011680479,0.02974572,0.0013055382,0.00033375862,0.0032762133,0.009634439,0.5801305,0.11667834,0.12661149,0.13063678,0.0003720691],"about_ca_topic_score_codex":0.0011590178,"about_ca_topic_score_gemma":0.0014585889,"teacher_disagreement_score":0.009070153,"about_ca_system_score_codex":0.0013606864,"about_ca_system_score_gemma":0.0018898093,"threshold_uncertainty_score":0.04796815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08833875,0.00048447185,0.888534,0.00032578208,0.0000766518,0.00007878853,0.00015404905,0.01941008,0.0025974899],"genre_scores_gemma":[0.41032338,0.00023192687,0.58220214,0.00027064208,0.000050257302,0.00008700568,0.00041688234,0.0039915675,0.00242622],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954745,0.00092870166,0.00018729907,0.000655301,0.0023576205,0.0003965424],"domain_scores_gemma":[0.9906132,0.005286697,0.0010809817,0.0019684816,0.00090147974,0.0001490619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017906211,0.000928257,0.0006636651,0.0015008871,0.0009848938,0.0015766682,0.002084684,0.0010931966,0.0025201112],"category_scores_gemma":[0.013269517,0.00074242364,0.0009988648,0.001397691,0.0015142722,0.0032298951,0.0021052223,0.0021436226,0.00064463937],"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.0006815158,0.00023359818,0.013003056,0.0006178687,0.00015025683,0.00042024345,0.0016098105,0.08754077,0.09991608,0.06456914,0.009807011,0.7214506],"study_design_scores_gemma":[0.000098836965,0.00021550027,0.006411966,0.00013569427,0.00010383006,0.000481649,0.00046943815,0.7495981,0.11820629,0.09599092,0.028135723,0.00015207678],"about_ca_topic_score_codex":0.0051414133,"about_ca_topic_score_gemma":0.0058461763,"teacher_disagreement_score":0.0051414133,"about_ca_system_score_codex":0.001309728,"about_ca_system_score_gemma":0.0021725614,"threshold_uncertainty_score":0.010222971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017419945,0.00017471137,0.9444724,0.00044596076,0.00017193794,0.00024608782,0.00034835088,0.020285469,0.016435115],"genre_scores_gemma":[0.08480997,0.00037042634,0.8972094,0.00039674278,0.000041276246,0.00040860934,0.0017084497,0.005829395,0.009225809],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997029,0.000547583,0.00038625582,0.00031552828,0.0014679721,0.0002535987],"domain_scores_gemma":[0.99700326,0.00074694125,0.0002487126,0.0011371336,0.0007438844,0.000119990356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029256884,0.00045250435,0.00045555056,0.0012198804,0.00063173,0.0032719125,0.0015521729,0.001247438,0.0067207003],"category_scores_gemma":[0.008463895,0.00086750265,0.0011011143,0.001178039,0.0006253893,0.001985732,0.0012262674,0.0016818093,0.0036444317],"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.0004455582,0.00056557247,0.004915105,0.0010390304,0.00014217329,0.00095715316,0.0015083068,0.0073295743,0.07184789,0.10490848,0.029589444,0.77675176],"study_design_scores_gemma":[0.0005961392,0.0005035939,0.00555657,0.00039742442,0.00024525597,0.004576426,0.000630797,0.112861976,0.113194086,0.07885802,0.6823653,0.00021441032],"about_ca_topic_score_codex":0.0014597484,"about_ca_topic_score_gemma":0.0017680547,"teacher_disagreement_score":0.0067207003,"about_ca_system_score_codex":0.00046467216,"about_ca_system_score_gemma":0.001269026,"threshold_uncertainty_score":0.022482932},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04468591,0.00017005429,0.94519866,0.00012158681,0.000040745166,0.00008681639,0.00009696621,0.0032067066,0.0063925544],"genre_scores_gemma":[0.30262458,0.0001339886,0.6921787,0.00008603431,0.00003404708,0.00018860295,0.0003021934,0.00076482206,0.0036870257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989507,0.0001606099,0.00005941252,0.00021140603,0.0004975408,0.00012029596],"domain_scores_gemma":[0.998444,0.00065078563,0.00017431098,0.00030812714,0.00037800873,0.00004473646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085744297,0.00064135465,0.0005953994,0.0006728781,0.00073196884,0.0009042123,0.00085465866,0.00044133642,0.0021871733],"category_scores_gemma":[0.0036251044,0.00043700042,0.00073142425,0.0007852393,0.0010367947,0.0008328235,0.0007491326,0.0007187099,0.0006174602],"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.0005122401,0.00023035551,0.0026001954,0.0006933629,0.00008042249,0.0004875264,0.0007529751,0.36935464,0.13299964,0.15014364,0.0064548333,0.33569014],"study_design_scores_gemma":[0.00008112924,0.00018485765,0.00025779405,0.00003777573,0.000044615743,0.00012755037,0.00007890261,0.8131881,0.11092631,0.061582476,0.01347137,0.000019240228],"about_ca_topic_score_codex":0.0016230056,"about_ca_topic_score_gemma":0.0024350549,"teacher_disagreement_score":0.0021871733,"about_ca_system_score_codex":0.00080161483,"about_ca_system_score_gemma":0.001439254,"threshold_uncertainty_score":0.007316768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8343518,0.0022494164,0.14834619,0.00031901075,0.00006454555,0.00012295348,0.00022054113,0.0017309631,0.012594664],"genre_scores_gemma":[0.9413906,0.00033272154,0.05542605,0.00006409002,0.000021292422,0.00011387805,0.00023890962,0.00031105327,0.0021014686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875927,0.0002485647,0.00006390784,0.00019139897,0.0004663171,0.00027043268],"domain_scores_gemma":[0.99633586,0.0018220294,0.00041717786,0.0005710749,0.00070268876,0.0001512615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012072088,0.00061861554,0.00041007338,0.0011300768,0.00070729683,0.0013710519,0.0018961212,0.0007402689,0.0021564818],"category_scores_gemma":[0.008062777,0.00033086358,0.00039540947,0.0016539658,0.0010252172,0.001617482,0.0009261359,0.000747042,0.0002587536],"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.000596693,0.0005222717,0.030800251,0.0005081048,0.00017924381,0.00054651295,0.0009121349,0.73627436,0.027542645,0.059828687,0.0050228317,0.13726626],"study_design_scores_gemma":[0.00003529347,0.000067419016,0.0036204539,0.000021988593,0.000030361542,0.000068504814,0.00016217062,0.979965,0.007584373,0.0061489427,0.0022809932,0.0000146189805],"about_ca_topic_score_codex":0.008550125,"about_ca_topic_score_gemma":0.0065208185,"teacher_disagreement_score":0.008550125,"about_ca_system_score_codex":0.001843899,"about_ca_system_score_gemma":0.0014904332,"threshold_uncertainty_score":0.017000735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04932217,0.0017396822,0.93297386,0.0014061424,0.00030686284,0.0004184968,0.00043902762,0.001377762,0.012015987],"genre_scores_gemma":[0.63263917,0.0015132093,0.35214317,0.00078396604,0.0005554093,0.001521813,0.00089573493,0.0006213682,0.009326089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98730844,0.0037159896,0.0013831602,0.0024075687,0.0041892924,0.0009955468],"domain_scores_gemma":[0.96811664,0.015931582,0.0025111856,0.00978311,0.0027123818,0.0009451099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064517604,0.000985788,0.0015033095,0.001985354,0.0028257188,0.0064598895,0.0036299748,0.0014840213,0.0072910786],"category_scores_gemma":[0.036134254,0.001458057,0.00164275,0.0032970386,0.006643715,0.01444898,0.008379186,0.004054184,0.0010681028],"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.00025895992,0.00011224834,0.0028414654,0.0003369238,0.00007448129,0.00022960527,0.0010902396,0.03606488,0.0039818403,0.9079892,0.002787958,0.04423228],"study_design_scores_gemma":[0.00013813325,0.00018097354,0.00042029365,0.0001267159,0.000082861254,0.0003504121,0.00026222286,0.17480896,0.007157841,0.78940356,0.026992543,0.00007540374],"about_ca_topic_score_codex":0.003285418,"about_ca_topic_score_gemma":0.0025843054,"teacher_disagreement_score":0.0072910786,"about_ca_system_score_codex":0.003325396,"about_ca_system_score_gemma":0.0042087496,"threshold_uncertainty_score":0.03412056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009300349,0.0004093408,0.9700753,0.0005733772,0.0003167296,0.00017339566,0.0014328334,0.0041142604,0.013604396],"genre_scores_gemma":[0.26835242,0.00091056316,0.6956896,0.0013573893,0.00037074275,0.0009882825,0.0029778671,0.00422737,0.025125768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928422,0.000956538,0.0013512061,0.0016541593,0.0025053709,0.000690593],"domain_scores_gemma":[0.98971575,0.0024071978,0.00083879475,0.00460466,0.002096508,0.000337102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005859275,0.0012228633,0.0014380936,0.0022191838,0.0017912025,0.0065139737,0.0048348536,0.002260287,0.007785496],"category_scores_gemma":[0.012510542,0.0014744062,0.0029491826,0.002912321,0.0053123487,0.017176386,0.006704765,0.0047204522,0.0026221466],"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.00007448532,0.000018185057,0.0012140797,0.0001175483,0.000024644536,0.00014958414,0.0004701887,0.0013677016,0.001865867,0.97120136,0.003552911,0.01994345],"study_design_scores_gemma":[0.000040440253,0.00006112384,0.00028561027,0.00015887161,0.00007776477,0.00046138238,0.0002297323,0.01389976,0.013813001,0.818886,0.15201052,0.00007590926],"about_ca_topic_score_codex":0.003376667,"about_ca_topic_score_gemma":0.0031980402,"teacher_disagreement_score":0.007785496,"about_ca_system_score_codex":0.002570983,"about_ca_system_score_gemma":0.0041153627,"threshold_uncertainty_score":0.030987144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03717155,0.00021941568,0.93993914,0.0002966209,0.00015314676,0.00026739802,0.0002803125,0.007514092,0.014158304],"genre_scores_gemma":[0.52632743,0.00039074366,0.4406108,0.00060396234,0.00015967803,0.0005632816,0.0006069449,0.0042572953,0.02647992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550915,0.0008662199,0.00049420795,0.000828883,0.0015740743,0.0007274903],"domain_scores_gemma":[0.98895955,0.0022970343,0.00075037684,0.0055866246,0.0017140231,0.00069232326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004204052,0.0009094285,0.0008106048,0.00094608316,0.0011071871,0.0028973236,0.004050558,0.0010560418,0.0073894486],"category_scores_gemma":[0.012280752,0.0012580234,0.0015012688,0.0009306685,0.0029688256,0.007268749,0.008541435,0.0023048555,0.0022723468],"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.0007279075,0.00020339937,0.009629367,0.0008665054,0.00015915745,0.0012042772,0.005247808,0.011432042,0.062607385,0.7101988,0.009217003,0.18850632],"study_design_scores_gemma":[0.00026985593,0.0008948554,0.0040740427,0.0006102878,0.0004979599,0.0028694666,0.0014760701,0.09998041,0.082515545,0.38487577,0.4214888,0.0004469253],"about_ca_topic_score_codex":0.0026577269,"about_ca_topic_score_gemma":0.0049424437,"teacher_disagreement_score":0.0073894486,"about_ca_system_score_codex":0.0010477119,"about_ca_system_score_gemma":0.002420435,"threshold_uncertainty_score":0.024720192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09410285,0.0006953882,0.88263804,0.0019089037,0.00017354538,0.000103303355,0.00007954737,0.0034232237,0.016875215],"genre_scores_gemma":[0.78971994,0.00046502042,0.19938914,0.00071483117,0.00018830464,0.00014810437,0.00023361767,0.0008321537,0.008308862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9898443,0.0022909082,0.00076185685,0.0016355116,0.0040974114,0.0013701174],"domain_scores_gemma":[0.98228204,0.007304668,0.0018015767,0.006427063,0.0016641011,0.00052062114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072815907,0.00066767837,0.0011236463,0.0014542097,0.0024078886,0.0060849725,0.002321673,0.0033563536,0.003978899],"category_scores_gemma":[0.037954222,0.0013936383,0.001278117,0.0019130671,0.004115816,0.015628472,0.012139865,0.0036179535,0.0012106287],"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.00058350875,0.00014137049,0.011224499,0.00037279743,0.00014077636,0.0028492184,0.006819336,0.041571915,0.0144279385,0.6008951,0.008562647,0.31241086],"study_design_scores_gemma":[0.00007099105,0.00014728835,0.0019321243,0.00012373575,0.00012302706,0.0023221683,0.0010654951,0.30847478,0.024535373,0.59471756,0.06638792,0.00009943206],"about_ca_topic_score_codex":0.002121306,"about_ca_topic_score_gemma":0.0014583304,"teacher_disagreement_score":0.0072815907,"about_ca_system_score_codex":0.0027750812,"about_ca_system_score_gemma":0.0016561152,"threshold_uncertainty_score":0.03850919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087930776,0.0007339426,0.8930515,0.0011024462,0.000207749,0.0001228214,0.0012042788,0.0036281706,0.012018352],"genre_scores_gemma":[0.43575108,0.0004433889,0.5501469,0.00031746484,0.0001544609,0.00018544703,0.0032360526,0.001502657,0.0082625495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933269,0.0010785484,0.00037538988,0.0012745496,0.0031656234,0.0007789695],"domain_scores_gemma":[0.9792763,0.006916662,0.002222127,0.0069790925,0.0041251974,0.00048064318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031837213,0.0008244562,0.000984853,0.005239545,0.0021625236,0.0044780695,0.0020990376,0.0027290469,0.0050455313],"category_scores_gemma":[0.04169274,0.0009316755,0.0010109334,0.004100944,0.001491258,0.008386256,0.005717893,0.0029225147,0.0028846215],"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.0002940123,0.00015532164,0.022137266,0.00035259346,0.000045032426,0.0007405312,0.001721335,0.012364718,0.014047226,0.2846404,0.019720709,0.64378095],"study_design_scores_gemma":[0.00007824621,0.000073120274,0.0074459836,0.00017715969,0.000083792125,0.0012468136,0.001164369,0.28721738,0.028738553,0.5423686,0.13128076,0.00012522157],"about_ca_topic_score_codex":0.00594134,"about_ca_topic_score_gemma":0.004367982,"teacher_disagreement_score":0.00594134,"about_ca_system_score_codex":0.0012498088,"about_ca_system_score_gemma":0.002539201,"threshold_uncertainty_score":0.016878963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0618417,0.00012385762,0.89656365,0.00014555687,0.000021853913,0.000091977185,0.00038986656,0.039461814,0.0013596835],"genre_scores_gemma":[0.41235104,0.00017316152,0.57998985,0.000111074565,0.00004453399,0.00015314599,0.0015226601,0.0040978463,0.001556664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561596,0.0011499015,0.0003200774,0.00075311115,0.0017064195,0.0004544727],"domain_scores_gemma":[0.9756378,0.014059959,0.00180728,0.005664486,0.0025090235,0.00032147244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038044762,0.0010142608,0.0013378151,0.0029678363,0.0013495653,0.0025734091,0.0021662186,0.0010511121,0.0024963822],"category_scores_gemma":[0.026606012,0.0012588222,0.0013358595,0.002399681,0.0019466386,0.0039037236,0.002989615,0.0015708406,0.001040316],"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.0008047699,0.00036629476,0.026127458,0.00086889905,0.0001926196,0.0009156134,0.0036161446,0.12016545,0.09434258,0.056060567,0.010167905,0.6863717],"study_design_scores_gemma":[0.00005198115,0.00013547162,0.0045821574,0.00012457269,0.00012472521,0.00046528951,0.00039034398,0.84680563,0.08143999,0.05121037,0.014549745,0.00011981501],"about_ca_topic_score_codex":0.00754783,"about_ca_topic_score_gemma":0.011365341,"teacher_disagreement_score":0.00754783,"about_ca_system_score_codex":0.0010500976,"about_ca_system_score_gemma":0.0032527386,"threshold_uncertainty_score":0.020120203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511543,0.0022438266,0.29802263,0.00057368854,0.00041629377,0.00025482973,0.0009842787,0.09187828,0.05447187],"genre_scores_gemma":[0.8847554,0.00030492034,0.094256245,0.0002288789,0.000050870534,0.0001695387,0.0010377446,0.0012663656,0.017930148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994567,0.00007783783,0.00003641716,0.00009036194,0.0002172973,0.0001212982],"domain_scores_gemma":[0.999335,0.00015857929,0.00009232003,0.00020308072,0.00018047291,0.000030457242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864925,0.0007198574,0.0003747615,0.00047484503,0.00035304626,0.0006634902,0.00094966165,0.0002958316,0.006098103],"category_scores_gemma":[0.0013223169,0.0003623622,0.00024042568,0.0006268441,0.00028797155,0.0008757018,0.0007183778,0.0006092367,0.001807696],"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.003046432,0.00028691068,0.003941839,0.00061705435,0.000069499096,0.0004782116,0.00029492826,0.044732876,0.41074896,0.015519318,0.03196532,0.48829857],"study_design_scores_gemma":[0.00051067345,0.0014956458,0.009305367,0.00014143047,0.00013472307,0.00061741064,0.0001242682,0.40174526,0.48987994,0.00851163,0.08737882,0.00015480848],"about_ca_topic_score_codex":0.0020427743,"about_ca_topic_score_gemma":0.002624813,"teacher_disagreement_score":0.006098103,"about_ca_system_score_codex":0.00062305003,"about_ca_system_score_gemma":0.0009888983,"threshold_uncertainty_score":0.020400167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228467,0.000051977273,0.9867931,0.00020355283,0.000035999587,0.0001942561,0.00061079685,0.0016409981,0.0042407494],"genre_scores_gemma":[0.27446136,0.00038670606,0.71151626,0.00064553594,0.000154827,0.0012644429,0.003445177,0.000977248,0.0071484167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600995,0.0010236938,0.00032651238,0.0008444037,0.0013272958,0.00046812193],"domain_scores_gemma":[0.9866644,0.008186458,0.00080848497,0.0017823882,0.0022918794,0.00026631652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031149224,0.0010944757,0.00064539514,0.0022033302,0.0014562731,0.0020561796,0.00248318,0.0011476825,0.005433366],"category_scores_gemma":[0.011332459,0.0007104262,0.0019693053,0.0014884602,0.00358395,0.0061629955,0.0023520947,0.0022926922,0.001152655],"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.00023781134,0.00015069573,0.0017028442,0.00041948524,0.000048157395,0.00045933115,0.00076518656,0.044774268,0.009631984,0.84191537,0.0046397042,0.09525515],"study_design_scores_gemma":[0.000046305195,0.0000718032,0.0002943339,0.00009766865,0.000057376037,0.00015536598,0.0001330342,0.10282788,0.018187819,0.8474837,0.030592494,0.00005221513],"about_ca_topic_score_codex":0.005078883,"about_ca_topic_score_gemma":0.0039469195,"teacher_disagreement_score":0.005433366,"about_ca_system_score_codex":0.0016624002,"about_ca_system_score_gemma":0.0023133634,"threshold_uncertainty_score":0.018176496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05458696,0.0005251539,0.92564094,0.00027186278,0.00008088201,0.00014196237,0.00017581311,0.015009475,0.003566977],"genre_scores_gemma":[0.37779677,0.00043888282,0.6165161,0.00015461947,0.000071118346,0.00019948486,0.0003746269,0.0011620523,0.003286394],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772257,0.0004435563,0.0003480058,0.00031011057,0.00088195974,0.00029378207],"domain_scores_gemma":[0.98795843,0.002714055,0.0011768636,0.006844588,0.0010625239,0.0002434953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019857953,0.00064619,0.0008196864,0.0011547002,0.0008998043,0.0021584209,0.0027570939,0.00074985006,0.0022513983],"category_scores_gemma":[0.00993291,0.0006142746,0.0006154988,0.0019895223,0.0012906123,0.0064191855,0.003932468,0.0013084006,0.0013298367],"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.0008811768,0.00037246398,0.010496186,0.0004469208,0.00013233512,0.00027806635,0.002328524,0.059020672,0.09125696,0.096753746,0.009189756,0.7288432],"study_design_scores_gemma":[0.00019672373,0.0006622908,0.0029909879,0.00012744927,0.00018627818,0.0008544169,0.0008691588,0.54414415,0.27812174,0.09472457,0.0769179,0.00020438033],"about_ca_topic_score_codex":0.0012885303,"about_ca_topic_score_gemma":0.0015486925,"teacher_disagreement_score":0.0027570939,"about_ca_system_score_codex":0.0007606351,"about_ca_system_score_gemma":0.0013232669,"threshold_uncertainty_score":0.010501981},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010804146,0.004700363,0.011783615,0.06011251,0.04803419,0.00029634387,0.0019115688,0.003972438,0.85838485],"genre_scores_gemma":[0.031128809,0.001653993,0.0035345217,0.015188754,0.0040698606,0.000118419426,0.00088348845,0.0007864124,0.9426359],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903536,0.00017839696,0.00003224948,0.00018784002,0.0002888423,0.00027736876],"domain_scores_gemma":[0.9966897,0.00019333772,0.00016728952,0.00024968036,0.00062638137,0.0020735809],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010342199,0.00086177804,0.0005603194,0.0006294178,0.0035774016,0.0049532666,0.0010695129,0.0015244589,0.42348254],"category_scores_gemma":[0.004966951,0.00028721776,0.0005875707,0.00044510703,0.00084668555,0.0041538463,0.005500062,0.0026698133,0.27568075],"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.00007112029,0.000049158647,0.0011729243,0.00006766428,0.0000075926914,0.00031865315,0.0007006453,0.000043309476,0.00044475586,0.008561467,0.92442036,0.06414232],"study_design_scores_gemma":[0.0000049129353,0.000026240721,0.00039663515,0.000045871115,0.000003973793,0.0004555459,0.000503671,0.00006164497,0.00012311927,0.0015121893,0.9968556,0.000010507149],"about_ca_topic_score_codex":0.00131422,"about_ca_topic_score_gemma":0.0029082224,"teacher_disagreement_score":0.42348254,"about_ca_system_score_codex":0.0007839888,"about_ca_system_score_gemma":0.0013404161,"threshold_uncertainty_score":0.8223322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020359462,0.00013186,0.94729435,0.00031310463,0.00007017887,0.00016994329,0.0010381527,0.028044142,0.0025789153],"genre_scores_gemma":[0.3770478,0.00014768488,0.6137108,0.00043413544,0.00005004663,0.00044868916,0.0027116728,0.0024968968,0.0029522337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593383,0.001426052,0.0003134856,0.0007820696,0.0012012857,0.00034334473],"domain_scores_gemma":[0.98551744,0.009908098,0.0008752775,0.0023125515,0.0012194567,0.00016716063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029032973,0.0015632102,0.000879745,0.0014788638,0.0009520021,0.0017281603,0.0031906518,0.0011491538,0.0073955194],"category_scores_gemma":[0.015314298,0.0011146729,0.0030867588,0.0011696556,0.0027231716,0.0034375926,0.002389651,0.0023593418,0.0010914328],"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.0014005599,0.00042404898,0.011470334,0.001443798,0.0004883283,0.0006282809,0.0005549598,0.6265643,0.023250813,0.14209238,0.01912418,0.17255801],"study_design_scores_gemma":[0.00016811064,0.00011287728,0.0002729577,0.0000553604,0.00006893177,0.000079141304,0.00005149479,0.9357536,0.016310666,0.04343346,0.0036671076,0.00002625255],"about_ca_topic_score_codex":0.014357806,"about_ca_topic_score_gemma":0.03031984,"teacher_disagreement_score":0.014357806,"about_ca_system_score_codex":0.0019802765,"about_ca_system_score_gemma":0.005421554,"threshold_uncertainty_score":0.02854848},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.146869,0.00032570816,0.8458116,0.0005715724,0.000031137097,0.00015722589,0.000046114998,0.0018782389,0.004309506],"genre_scores_gemma":[0.6976838,0.00015688977,0.29912654,0.00017832227,0.000016148382,0.00008717928,0.000107256674,0.0003527745,0.0022910957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99057454,0.0036856655,0.0004834232,0.0013577497,0.0026262293,0.0012724382],"domain_scores_gemma":[0.9689799,0.02079769,0.002210905,0.0043369583,0.00248691,0.0011875806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008256423,0.00078099425,0.0007622943,0.0011264774,0.0013033542,0.0033409803,0.0019619556,0.0013106045,0.002529246],"category_scores_gemma":[0.033409722,0.0012070639,0.0010883772,0.00076882984,0.0016256014,0.005596916,0.003920249,0.0024190708,0.00047642936],"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.0009982714,0.00032964957,0.018078512,0.00041462024,0.00020079614,0.0013746275,0.0050064744,0.27502027,0.04401029,0.2307016,0.0035740505,0.42029083],"study_design_scores_gemma":[0.00007816106,0.00032709513,0.001932271,0.00008023038,0.0001698354,0.00027330514,0.0008129794,0.7828312,0.030663898,0.16898955,0.0137621015,0.00007931987],"about_ca_topic_score_codex":0.006244054,"about_ca_topic_score_gemma":0.008556623,"teacher_disagreement_score":0.008256423,"about_ca_system_score_codex":0.0023650809,"about_ca_system_score_gemma":0.0029432087,"threshold_uncertainty_score":0.043664634},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07246007,0.011602395,0.34882358,0.12758574,0.012886277,0.0008865976,0.011613053,0.0058886604,0.40825367],"genre_scores_gemma":[0.61982876,0.009622726,0.102251895,0.018472418,0.0041509937,0.00069265213,0.009159482,0.00175917,0.23406187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751544,0.000599836,0.0001787419,0.0005276448,0.00072980573,0.00044864326],"domain_scores_gemma":[0.99386966,0.0023932904,0.0004858688,0.0015256323,0.0010165814,0.0007090057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031934574,0.0007438106,0.00071722106,0.0011952091,0.0036898507,0.008138766,0.0019325707,0.0031011763,0.039327532],"category_scores_gemma":[0.013547817,0.0007041969,0.00094367,0.0016293126,0.0017188248,0.013718739,0.0032430626,0.0028433572,0.009306798],"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.00076805445,0.00018862766,0.007553639,0.0003553789,0.00007071029,0.0017973694,0.0015193304,0.0063340575,0.0013830962,0.68280476,0.12074738,0.17647764],"study_design_scores_gemma":[0.00006825039,0.000106640226,0.0013609134,0.00023821658,0.00007923854,0.0009754625,0.002081819,0.021654423,0.0030522505,0.53861535,0.43168503,0.000082404],"about_ca_topic_score_codex":0.0038383629,"about_ca_topic_score_gemma":0.002828188,"teacher_disagreement_score":0.039327532,"about_ca_system_score_codex":0.0020199788,"about_ca_system_score_gemma":0.0018243784,"threshold_uncertainty_score":0.13156372},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040891673,0.00034378213,0.9837753,0.00024297684,0.000057926994,0.000065406304,0.00014732483,0.002390088,0.0088880025],"genre_scores_gemma":[0.14059074,0.0006603634,0.8514326,0.00025785388,0.000105423824,0.00048264267,0.00061722816,0.001180581,0.0046725934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811506,0.00069274317,0.00012031689,0.00023102309,0.0006772652,0.00016365421],"domain_scores_gemma":[0.9969875,0.0022446918,0.00019205415,0.00027900282,0.00024402732,0.00005279047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014737339,0.0018036042,0.0011890772,0.001415159,0.0005261568,0.0016951794,0.0013596015,0.0012521244,0.008946152],"category_scores_gemma":[0.0064303875,0.0007298065,0.0019596666,0.0016973458,0.0014591529,0.0013725837,0.0020018353,0.0023242615,0.00226223],"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.00010092181,0.000065582826,0.0004646434,0.00041319575,0.00007948019,0.00009574806,0.00006938921,0.81204873,0.0027248461,0.085959576,0.0031456153,0.09483229],"study_design_scores_gemma":[0.000032312815,0.000019901765,0.000039321745,0.000028257911,0.0000138489195,0.000018370578,0.000011928636,0.9577589,0.0013412826,0.037077986,0.0036516215,0.000006190738],"about_ca_topic_score_codex":0.0032419933,"about_ca_topic_score_gemma":0.0048244167,"teacher_disagreement_score":0.008946152,"about_ca_system_score_codex":0.0015366772,"about_ca_system_score_gemma":0.0023083768,"threshold_uncertainty_score":0.02992785},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016970696,0.0002693095,0.93548226,0.00045930673,0.00024960467,0.0000710435,0.0009219085,0.04689857,0.01395091],"genre_scores_gemma":[0.067292675,0.0007850705,0.89139944,0.00081532216,0.00029184573,0.00053066603,0.0028593028,0.021926932,0.014098781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752265,0.0006230171,0.00028020373,0.00026224682,0.0011293234,0.00018257146],"domain_scores_gemma":[0.9941468,0.0024903503,0.00049794966,0.0010014924,0.0017246179,0.000138705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094528,0.0010250068,0.0007016851,0.002629072,0.0010691091,0.0028458245,0.0019723508,0.0008282137,0.050564088],"category_scores_gemma":[0.016246017,0.00064182153,0.0021316723,0.0015146068,0.0010317817,0.0040788874,0.002733902,0.0020667452,0.014770655],"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.00038972363,0.000053665124,0.0026103535,0.0012242966,0.00011901496,0.00060574664,0.00056784414,0.018168652,0.008257387,0.43668824,0.16625094,0.36506426],"study_design_scores_gemma":[0.00008880839,0.000071071445,0.0009555434,0.00038182922,0.00008032678,0.0011361057,0.00021032103,0.13149653,0.020035556,0.3345361,0.51089895,0.00010895007],"about_ca_topic_score_codex":0.0015892106,"about_ca_topic_score_gemma":0.0020702938,"teacher_disagreement_score":0.050564088,"about_ca_system_score_codex":0.0011188276,"about_ca_system_score_gemma":0.0019165027,"threshold_uncertainty_score":0.16915369},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0407806,0.0012487387,0.69183475,0.0008085501,0.0007114325,0.0014373868,0.006529484,0.24383704,0.012812021],"genre_scores_gemma":[0.27132538,0.0008001498,0.6761053,0.00085087057,0.00034733798,0.0015038013,0.025484627,0.015608067,0.0079743825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976618,0.00038110532,0.00017844501,0.00053907104,0.000963191,0.0002763262],"domain_scores_gemma":[0.998589,0.0002558997,0.00011118305,0.000619643,0.00026905106,0.00015522716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025332682,0.0016079955,0.0010072303,0.0009305466,0.0009680193,0.0015402377,0.0038171185,0.0007773423,0.0039094794],"category_scores_gemma":[0.0034983417,0.00085555617,0.0015894445,0.0011860315,0.00068724016,0.0022690173,0.004123152,0.001983131,0.004151853],"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.002685396,0.0013689115,0.0054907477,0.002801499,0.0008681632,0.0012849073,0.0013721875,0.051031146,0.11440033,0.021811066,0.3629983,0.43388736],"study_design_scores_gemma":[0.0012505718,0.0011316933,0.013014482,0.00021850737,0.00018402534,0.0018174857,0.0005845358,0.55687594,0.12395028,0.05131573,0.24919339,0.00046342434],"about_ca_topic_score_codex":0.0026418688,"about_ca_topic_score_gemma":0.0028382447,"teacher_disagreement_score":0.0039094794,"about_ca_system_score_codex":0.00052951433,"about_ca_system_score_gemma":0.0013879733,"threshold_uncertainty_score":0.013397396},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02213538,0.0017100231,0.9205765,0.0027199474,0.0011297686,0.00020338608,0.00033614278,0.004758536,0.046430282],"genre_scores_gemma":[0.25466633,0.0017503246,0.70836055,0.003412681,0.0009017343,0.0005527162,0.0005818029,0.0024183774,0.02735558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953648,0.0014942499,0.00042329487,0.0009617563,0.001358295,0.00039771662],"domain_scores_gemma":[0.991245,0.003144651,0.00037466062,0.0033342573,0.001363481,0.00053790124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054205824,0.00068278104,0.00081054866,0.0018280786,0.003098287,0.0050633987,0.002973015,0.0016609567,0.008057684],"category_scores_gemma":[0.014882533,0.0014907257,0.0017463845,0.0009465867,0.0061003715,0.016074274,0.011456348,0.0040694573,0.0032552164],"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.000035929137,0.000015019014,0.00045862235,0.00011658339,0.000010642665,0.00008968936,0.00060343096,0.0007473062,0.0012548463,0.9666303,0.003083513,0.026954176],"study_design_scores_gemma":[0.00003568113,0.000059284535,0.00022889984,0.00021939185,0.00005208877,0.00044840737,0.0002048523,0.006500245,0.00645751,0.737339,0.24840833,0.000046399633],"about_ca_topic_score_codex":0.0013824491,"about_ca_topic_score_gemma":0.0020810666,"teacher_disagreement_score":0.008057684,"about_ca_system_score_codex":0.0017654066,"about_ca_system_score_gemma":0.0023526822,"threshold_uncertainty_score":0.028667092},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026647309,0.00058710657,0.9296892,0.0010808082,0.00044794776,0.00014031274,0.0002840015,0.009955426,0.031167813],"genre_scores_gemma":[0.45649144,0.000849586,0.51268274,0.0016614007,0.00046608958,0.00032589724,0.00087505137,0.004375839,0.022272011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840623,0.0002382656,0.0001488208,0.00032157346,0.00060096744,0.00028419],"domain_scores_gemma":[0.99753416,0.00045991136,0.00022061821,0.0013607738,0.00032337522,0.000101168436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019704574,0.00029254914,0.0005037529,0.00056727725,0.00072793703,0.0023791431,0.0011641574,0.0010739517,0.005729877],"category_scores_gemma":[0.004982468,0.0005368658,0.0010144289,0.000577418,0.0029331453,0.0042241537,0.0040106913,0.0020963436,0.0014309448],"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.00009426829,0.00004870435,0.0015145873,0.00027566985,0.00001853746,0.0001966705,0.0007714883,0.002420517,0.012384906,0.8780482,0.008409769,0.09581673],"study_design_scores_gemma":[0.00009021443,0.00013872956,0.0022038692,0.0003285992,0.00012605224,0.0011187432,0.00019802473,0.0356518,0.017940527,0.48605824,0.4560354,0.000109776876],"about_ca_topic_score_codex":0.0010494841,"about_ca_topic_score_gemma":0.0011830864,"teacher_disagreement_score":0.005729877,"about_ca_system_score_codex":0.0009919632,"about_ca_system_score_gemma":0.0013537297,"threshold_uncertainty_score":0.019168377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5068516,0.020902116,0.32810935,0.013933258,0.001866226,0.00047991629,0.003937051,0.041428324,0.082492106],"genre_scores_gemma":[0.7876521,0.0053699724,0.19012664,0.00095155626,0.0003015183,0.00030045537,0.0074170316,0.0044175265,0.0034631956],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9872684,0.003688596,0.0007802493,0.0009956697,0.0062592435,0.0010078484],"domain_scores_gemma":[0.9814897,0.004445678,0.0008208575,0.0056132404,0.006289772,0.0013406789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011522049,0.001142461,0.0010704094,0.0023173497,0.0009680078,0.004933259,0.0034110248,0.0012173018,0.0020372549],"category_scores_gemma":[0.02456964,0.00048078713,0.0007014444,0.006196451,0.001383958,0.0063294736,0.0024100235,0.002748167,0.0013664719],"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.0019648583,0.0019623658,0.034751147,0.0012188291,0.00040292385,0.00034060536,0.00083409774,0.24225943,0.021868631,0.06492284,0.08214524,0.5473291],"study_design_scores_gemma":[0.00013029022,0.00049187767,0.013685673,0.00042052893,0.00010373585,0.00022494794,0.0007674987,0.8566854,0.028384104,0.03763806,0.06133088,0.00013712342],"about_ca_topic_score_codex":0.008670414,"about_ca_topic_score_gemma":0.0060668825,"teacher_disagreement_score":0.011522049,"about_ca_system_score_codex":0.002078626,"about_ca_system_score_gemma":0.0027844408,"threshold_uncertainty_score":0.0609352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059891646,0.03232485,0.5945636,0.039944496,0.0052023306,0.00047701198,0.0037837478,0.0035881072,0.3141267],"genre_scores_gemma":[0.15954173,0.046536252,0.567459,0.029401686,0.0068014716,0.0012807887,0.007657138,0.0025535226,0.17876837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942154,0.0018791696,0.00057417346,0.0008765091,0.0021772673,0.00027739516],"domain_scores_gemma":[0.9937789,0.002554307,0.00046873602,0.0020633906,0.0008595629,0.0002750705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042340094,0.00080585893,0.000784306,0.0027057417,0.002179882,0.009970904,0.0023175494,0.0032814308,0.012111209],"category_scores_gemma":[0.012109253,0.00059429044,0.00092480704,0.0045194556,0.0074348194,0.014780734,0.0056431876,0.0047640745,0.0069203386],"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.000016782047,0.000011784179,0.00021323065,0.00023085409,0.000016607615,0.000116877745,0.0010227036,0.00045310298,0.00058255,0.92537147,0.020034334,0.05192962],"study_design_scores_gemma":[0.000006259376,0.000016182394,0.00014567337,0.0002799038,0.000009625726,0.00033778092,0.00029309993,0.00054443144,0.00042352354,0.25013986,0.7477864,0.000017273629],"about_ca_topic_score_codex":0.0026607532,"about_ca_topic_score_gemma":0.0014622583,"teacher_disagreement_score":0.012111209,"about_ca_system_score_codex":0.0015222498,"about_ca_system_score_gemma":0.00289554,"threshold_uncertainty_score":0.04051608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1214676,0.00044576646,0.83629906,0.00048399073,0.00015509527,0.00015820962,0.0002685739,0.013000584,0.027721103],"genre_scores_gemma":[0.562387,0.0007091032,0.41869047,0.0005198028,0.00015613681,0.00026739322,0.0013093593,0.0009163154,0.015044341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.00004766073,0.00005108396,0.00004161692,0.00012504804,0.000035830824],"domain_scores_gemma":[0.9990858,0.0002285046,0.000092312934,0.00031259158,0.00024348093,0.000037326336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003017235,0.00041236135,0.00031798924,0.00065943395,0.0004195863,0.0010391972,0.0014926048,0.0003381032,0.005286507],"category_scores_gemma":[0.001476878,0.00036460362,0.00040737813,0.0007927578,0.00038736974,0.0017726894,0.0008053262,0.000954488,0.002024098],"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.00078877364,0.00031556573,0.003900485,0.00062110525,0.00008317242,0.0007639004,0.0004577494,0.049926087,0.3473815,0.14770198,0.013906593,0.4341532],"study_design_scores_gemma":[0.00016306025,0.00071533106,0.001505755,0.00008990506,0.00012009637,0.0010273469,0.00014383333,0.5108031,0.3453837,0.061694354,0.07827205,0.00008143668],"about_ca_topic_score_codex":0.0004260358,"about_ca_topic_score_gemma":0.0014151018,"teacher_disagreement_score":0.005286507,"about_ca_system_score_codex":0.00035551842,"about_ca_system_score_gemma":0.00072000764,"threshold_uncertainty_score":0.017685175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027485434,0.00022041157,0.9908483,0.00061199116,0.00011875242,0.000034804605,0.00009674236,0.00060653005,0.004713951],"genre_scores_gemma":[0.16274534,0.0010026764,0.82743907,0.00078816613,0.00050538935,0.00032116642,0.00034301623,0.00053917215,0.006315924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973326,0.0006172837,0.00031651088,0.00041637573,0.0010295295,0.00028779972],"domain_scores_gemma":[0.9965127,0.0011845684,0.0003251331,0.0010145562,0.00075891224,0.00020420489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004947713,0.0007433897,0.00083871395,0.0015199735,0.0020564182,0.0049122,0.0027268608,0.0017440992,0.0046181674],"category_scores_gemma":[0.0048288717,0.0011416412,0.003097941,0.0021027054,0.0072031077,0.012134148,0.0041655777,0.0070023634,0.0020530918],"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.000005479331,0.000006483446,0.000051720497,0.000029313716,0.0000036841748,0.000024373294,0.00016120331,0.00091089343,0.00059914205,0.9934453,0.00046602174,0.0042964765],"study_design_scores_gemma":[0.000017789573,0.000026581696,0.00008114273,0.0000440852,0.000019458865,0.00012692102,0.00006336318,0.010376453,0.002368949,0.96219176,0.02465463,0.000028840897],"about_ca_topic_score_codex":0.0021758582,"about_ca_topic_score_gemma":0.001573853,"teacher_disagreement_score":0.004947713,"about_ca_system_score_codex":0.0025125365,"about_ca_system_score_gemma":0.0035935135,"threshold_uncertainty_score":0.02616626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035242417,0.00035234404,0.9569128,0.0010473998,0.00039293626,0.00025651476,0.00024851406,0.0141295735,0.0231355],"genre_scores_gemma":[0.15583898,0.0011516219,0.77072614,0.0018303746,0.0005050986,0.00085011014,0.0016387168,0.0068504075,0.060608506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.987512,0.0032305997,0.0018221503,0.0020428223,0.0039280523,0.0014642681],"domain_scores_gemma":[0.9840608,0.0024862876,0.0010900742,0.009141505,0.002499525,0.0007217887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011789331,0.001138412,0.001188275,0.0016843493,0.0019065758,0.008416706,0.006807077,0.0022601837,0.016347932],"category_scores_gemma":[0.017330017,0.0016262517,0.0037617073,0.0017353996,0.0043895934,0.016166313,0.011717661,0.008335305,0.013209235],"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.00012677051,0.00007737008,0.00056460703,0.0002315296,0.00003332238,0.00018058837,0.0019541953,0.0025693001,0.0058541056,0.92030454,0.012775042,0.05532858],"study_design_scores_gemma":[0.00009552321,0.00014838374,0.00026187627,0.0002353377,0.00012216392,0.0006779158,0.00047469191,0.02720501,0.014083414,0.3880797,0.56847394,0.00014201568],"about_ca_topic_score_codex":0.0019086838,"about_ca_topic_score_gemma":0.002124752,"teacher_disagreement_score":0.016347932,"about_ca_system_score_codex":0.0028778145,"about_ca_system_score_gemma":0.0054424875,"threshold_uncertainty_score":0.062348723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18189631,0.0015577878,0.81125635,0.00041103273,0.00013908192,0.00013193593,0.000026095462,0.0012403593,0.0033410047],"genre_scores_gemma":[0.76696396,0.0004605253,0.23115014,0.00010392548,0.0000923897,0.000084330706,0.000043564418,0.00011329338,0.0009878285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.00057833083,0.00010485055,0.00015378161,0.0004738723,0.00023022322],"domain_scores_gemma":[0.9967265,0.0014477677,0.00042472332,0.0007188417,0.000533575,0.00014849874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925885,0.00052285637,0.0007526352,0.000721991,0.0010055394,0.0011996494,0.0013355407,0.00052283646,0.0006993225],"category_scores_gemma":[0.0056634783,0.00032901278,0.00040243383,0.0012974927,0.0009974022,0.001721945,0.0009472453,0.0007538609,0.00014560243],"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.0005129668,0.0002877236,0.0072519346,0.00032038378,0.0001329134,0.00021481772,0.00039967697,0.5827483,0.059867103,0.04733198,0.0031057089,0.2978265],"study_design_scores_gemma":[0.00003563484,0.00015485976,0.0005182026,0.000014027402,0.000034956767,0.000060040245,0.00006427387,0.9597975,0.017493576,0.018603522,0.0032060882,0.000017266178],"about_ca_topic_score_codex":0.002144804,"about_ca_topic_score_gemma":0.0033307213,"teacher_disagreement_score":0.002144804,"about_ca_system_score_codex":0.0010861001,"about_ca_system_score_gemma":0.0022073593,"threshold_uncertainty_score":0.010185182},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19812271,0.0011665248,0.7685531,0.0005738817,0.0001868224,0.00048657123,0.00065119367,0.014290375,0.015968792],"genre_scores_gemma":[0.58327186,0.0006875676,0.401994,0.0003916523,0.00008238293,0.0004033147,0.0016831371,0.0010581937,0.010427909],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939215,0.00006117696,0.00003739733,0.00007999292,0.00036102996,0.00006832845],"domain_scores_gemma":[0.9985525,0.00036946987,0.00017115774,0.0003593263,0.00050338934,0.000044078508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030576347,0.00059615576,0.0003773734,0.0012124665,0.0003905117,0.00059404917,0.0008880626,0.00050518464,0.0020597],"category_scores_gemma":[0.0034998697,0.0002009528,0.00023155479,0.0012027966,0.00042865952,0.0007153507,0.0007618923,0.0005580561,0.0013024731],"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.00062348106,0.00020321134,0.0034351586,0.00027047974,0.00002952302,0.00036089236,0.00033367093,0.042164437,0.18712732,0.012262198,0.010947574,0.7422421],"study_design_scores_gemma":[0.00010542221,0.00035656666,0.0036735504,0.000086753345,0.000037726568,0.0011831521,0.00017878671,0.57860017,0.37440202,0.012130812,0.029189184,0.00005585694],"about_ca_topic_score_codex":0.0015300121,"about_ca_topic_score_gemma":0.0023151273,"teacher_disagreement_score":0.0020597,"about_ca_system_score_codex":0.00038163338,"about_ca_system_score_gemma":0.0010231546,"threshold_uncertainty_score":0.0068903565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13788415,0.0004402265,0.8526396,0.00029853234,0.00004928556,0.000072464914,0.00008540082,0.0037526407,0.004777718],"genre_scores_gemma":[0.7601757,0.00025918547,0.23668371,0.00009953039,0.000045570425,0.000079649,0.00028304564,0.00034552772,0.002028031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910337,0.00023777458,0.000052682535,0.000116282165,0.0003334364,0.00015638063],"domain_scores_gemma":[0.9983418,0.0007947963,0.00010186178,0.0003576273,0.00032829368,0.00007554132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215807,0.00081917184,0.00066793134,0.0004521458,0.00046337504,0.0009408824,0.0010399171,0.0005481069,0.0014846277],"category_scores_gemma":[0.0047070384,0.0002693538,0.00038501868,0.0011271064,0.0005478196,0.002043889,0.0010847822,0.00084220007,0.00074311625],"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.00028073083,0.00020483037,0.0019376248,0.00007749915,0.000033213324,0.00007037641,0.00011361129,0.79210144,0.020561568,0.012817946,0.0026021015,0.16919899],"study_design_scores_gemma":[0.0000044275434,0.000019269404,0.00009605317,0.0000015916206,0.0000024092762,0.000008693157,0.000008769422,0.99377656,0.0030802025,0.0026666645,0.0003326381,0.0000027169667],"about_ca_topic_score_codex":0.0027767695,"about_ca_topic_score_gemma":0.0034493331,"teacher_disagreement_score":0.0027767695,"about_ca_system_score_codex":0.00081021746,"about_ca_system_score_gemma":0.0014091241,"threshold_uncertainty_score":0.0058785677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030617187,0.0001976418,0.9613279,0.00030790837,0.00006387976,0.00005963324,0.000087087246,0.0019822915,0.0053564613],"genre_scores_gemma":[0.5591253,0.0003218185,0.42789412,0.00046662847,0.00015061637,0.00029463408,0.00024969416,0.0016247715,0.009872512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930835,0.0015925529,0.0005722097,0.0017573066,0.0022075938,0.0007868836],"domain_scores_gemma":[0.9903368,0.0046696034,0.0005433715,0.0027364,0.0014409071,0.00027293136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005993903,0.00049350597,0.0012746388,0.0010166323,0.0017403176,0.0032132815,0.0022802935,0.0010848137,0.0029607194],"category_scores_gemma":[0.013726987,0.0010682717,0.0022991782,0.0009839057,0.006196345,0.010374809,0.0058368607,0.0042091035,0.0008996054],"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.000062882056,0.000028635997,0.0011670358,0.00008690718,0.000019139503,0.00015937095,0.0009891732,0.00410999,0.003934941,0.9716414,0.00059680187,0.017203711],"study_design_scores_gemma":[0.000044021806,0.000084045016,0.0005235539,0.00008005663,0.000090490175,0.0004045422,0.00015005523,0.07876595,0.024941063,0.8655081,0.029332377,0.00007572189],"about_ca_topic_score_codex":0.0039745285,"about_ca_topic_score_gemma":0.002942898,"teacher_disagreement_score":0.005993903,"about_ca_system_score_codex":0.0033158595,"about_ca_system_score_gemma":0.0029524362,"threshold_uncertainty_score":0.03169918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016633641,0.0025969935,0.9520091,0.00082230347,0.00028586824,0.00048207358,0.0019745121,0.004509241,0.020686336],"genre_scores_gemma":[0.20694257,0.0018094925,0.7770247,0.00030729777,0.00023717502,0.0023394385,0.0039727674,0.0017583069,0.0056082574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907206,0.0020227619,0.0013547904,0.0009470101,0.004610781,0.00034408056],"domain_scores_gemma":[0.9880723,0.004051528,0.0024009214,0.0019419497,0.003145456,0.00038781326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047700154,0.0014261466,0.00075872533,0.0059416946,0.0010678316,0.0037414478,0.0012603867,0.0010063171,0.0031522184],"category_scores_gemma":[0.03774475,0.0005297925,0.0008780726,0.0065844236,0.0014050336,0.0050420715,0.0030432683,0.0018147695,0.001165888],"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.000106962456,0.00012380676,0.0057759043,0.00070183456,0.00007753446,0.00012802683,0.000732841,0.054198254,0.01064251,0.57158184,0.017606653,0.33832386],"study_design_scores_gemma":[0.00003801933,0.00048333185,0.0085235275,0.00039322022,0.00006562357,0.0005497205,0.00038358523,0.2125506,0.009190485,0.5482554,0.21939133,0.00017524787],"about_ca_topic_score_codex":0.003746773,"about_ca_topic_score_gemma":0.00324642,"teacher_disagreement_score":0.0059416946,"about_ca_system_score_codex":0.0023339863,"about_ca_system_score_gemma":0.0017864625,"threshold_uncertainty_score":0.025226533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014197795,0.000107541455,0.9775612,0.00029771234,0.00003003713,0.00007765447,0.000050937197,0.0011115663,0.0065656193],"genre_scores_gemma":[0.17758885,0.00025827644,0.8161151,0.00027327106,0.00003220158,0.0001736533,0.00019849635,0.00061456684,0.004745534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883753,0.00032871775,0.00009150754,0.00024063865,0.00040135675,0.000100212426],"domain_scores_gemma":[0.996375,0.002269109,0.00017772264,0.0007744291,0.00035346657,0.00005024279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011754748,0.00058258814,0.00036218157,0.00064295233,0.0007458783,0.0017933941,0.0011681754,0.0011520002,0.0053655654],"category_scores_gemma":[0.006240336,0.0004228901,0.00087745325,0.00057246716,0.0018298973,0.0026619153,0.0014095039,0.001511874,0.0014840467],"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.00024371623,0.00012255645,0.001521208,0.0005941185,0.00004489708,0.0004698755,0.000774097,0.1433473,0.089352265,0.5248381,0.002332549,0.23635936],"study_design_scores_gemma":[0.00013087993,0.0003576876,0.00046149245,0.00020234605,0.00008866985,0.0005494844,0.00021309184,0.45578352,0.15023133,0.34768292,0.044236396,0.00006215062],"about_ca_topic_score_codex":0.0010212968,"about_ca_topic_score_gemma":0.0021297522,"teacher_disagreement_score":0.0053655654,"about_ca_system_score_codex":0.00072755106,"about_ca_system_score_gemma":0.0008233987,"threshold_uncertainty_score":0.01794964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03223489,0.00007064045,0.9555158,0.00040412147,0.000071167065,0.000107048705,0.00033992247,0.007681959,0.003574467],"genre_scores_gemma":[0.38228515,0.00012636595,0.60829884,0.00054668577,0.000081755985,0.00019183978,0.0005472428,0.0014955574,0.0064266035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974527,0.00044125115,0.0001636208,0.0005258792,0.0011598354,0.0002567967],"domain_scores_gemma":[0.99397767,0.0012675176,0.00035919112,0.0027961044,0.0014941026,0.000105463616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017787818,0.0006130534,0.000688076,0.0013022765,0.0008135801,0.001753236,0.002608271,0.0011409171,0.0036920356],"category_scores_gemma":[0.0067362357,0.0008356291,0.0014595587,0.00110884,0.0014704677,0.0034366716,0.0020293815,0.0018247665,0.0011534074],"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.0015803811,0.0003723572,0.021959735,0.0004546898,0.00018107446,0.0005911296,0.00085834594,0.12801622,0.13856013,0.23283717,0.021274872,0.45331395],"study_design_scores_gemma":[0.00010602265,0.00016473561,0.0022248593,0.000043862998,0.00009783094,0.000427178,0.00012253068,0.8206576,0.063348286,0.09392615,0.018772505,0.00010836491],"about_ca_topic_score_codex":0.0032792264,"about_ca_topic_score_gemma":0.0039211637,"teacher_disagreement_score":0.0036920356,"about_ca_system_score_codex":0.0014671596,"about_ca_system_score_gemma":0.0022394357,"threshold_uncertainty_score":0.012351096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065055992,0.000021190222,0.9873707,0.00010144898,0.000020998006,0.00014325495,0.000048439168,0.0031119613,0.002676345],"genre_scores_gemma":[0.068296306,0.00009918539,0.92355883,0.00014849969,0.000010291468,0.00061444374,0.00034984466,0.0021814837,0.004741031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986326,0.0004069556,0.00012215831,0.00019001965,0.00053654576,0.00011165971],"domain_scores_gemma":[0.9958293,0.0016997922,0.0002733868,0.0013252086,0.00074786897,0.00012444908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020095,0.0010035349,0.0002973832,0.0007289109,0.00050795963,0.0014042129,0.0015863003,0.00088671566,0.00315433],"category_scores_gemma":[0.008312499,0.0007121945,0.0008636428,0.00059768703,0.001268098,0.0016392362,0.0016590655,0.0013509897,0.0013255223],"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.00032773335,0.00049787137,0.007273499,0.0011944234,0.0001523856,0.0016534345,0.0048906715,0.108580954,0.07537103,0.29132605,0.023755187,0.48497677],"study_design_scores_gemma":[0.00031979193,0.00040911685,0.0012969583,0.00022462546,0.00015149052,0.0017986041,0.00056184997,0.46781987,0.1362889,0.16169834,0.2293048,0.00012573386],"about_ca_topic_score_codex":0.00097615825,"about_ca_topic_score_gemma":0.0015568918,"teacher_disagreement_score":0.00315433,"about_ca_system_score_codex":0.0005730967,"about_ca_system_score_gemma":0.0012716424,"threshold_uncertainty_score":0.010683417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16515289,0.0008616003,0.82211506,0.00021312082,0.000028418031,0.00011718076,0.00008615739,0.009686526,0.0017390967],"genre_scores_gemma":[0.67665267,0.00044121055,0.32027614,0.00006478102,0.000014689148,0.000064884654,0.0001248344,0.0004930878,0.0018677026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967895,0.0009485062,0.00019986928,0.0005011366,0.0013635459,0.00019735996],"domain_scores_gemma":[0.9902822,0.0043778066,0.0013159905,0.00310257,0.00069352885,0.0002278173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673765,0.000698232,0.0006095643,0.0017489467,0.0009025077,0.0015390554,0.002340922,0.0010591485,0.0009841697],"category_scores_gemma":[0.012995195,0.0010167365,0.0005870736,0.0014572615,0.0018553521,0.0023088227,0.0015518826,0.0013287404,0.0003248766],"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.0011590864,0.00045716448,0.017260449,0.0008238977,0.00016185423,0.0008002274,0.002497506,0.32572886,0.10208,0.10361515,0.0030283674,0.44238743],"study_design_scores_gemma":[0.00011015066,0.00042581453,0.0025455698,0.00011981306,0.000114316594,0.00063304236,0.00025288918,0.7881429,0.1394299,0.057915397,0.010231675,0.00007851315],"about_ca_topic_score_codex":0.0032554392,"about_ca_topic_score_gemma":0.002491156,"teacher_disagreement_score":0.0032554392,"about_ca_system_score_codex":0.0016425718,"about_ca_system_score_gemma":0.0016981848,"threshold_uncertainty_score":0.0141403675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28919527,0.000305719,0.70293397,0.0005185188,0.000022338623,0.00005511111,0.00006853014,0.001655315,0.0052451943],"genre_scores_gemma":[0.82961804,0.00010573235,0.16837665,0.000056148026,0.000014942246,0.000049922997,0.0000808241,0.00021361373,0.0014840832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991399,0.00027255202,0.000042440803,0.00008192359,0.00026399674,0.00019923129],"domain_scores_gemma":[0.99832064,0.00078766467,0.00018745537,0.0004571841,0.00019850716,0.000048584978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010288522,0.00072346214,0.00050895975,0.0005051924,0.00043250073,0.00080617424,0.0011917714,0.00042451415,0.0014246473],"category_scores_gemma":[0.0037979414,0.00034904337,0.00032472395,0.0007875121,0.00056388276,0.00189347,0.00066498894,0.00055133057,0.00033840936],"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.00047379517,0.00018486634,0.0021386743,0.000099038676,0.000043870463,0.00018730036,0.00015126733,0.7189932,0.05904791,0.028429508,0.0021886444,0.18806194],"study_design_scores_gemma":[0.00002474258,0.00012919038,0.00027463873,0.0000048917545,0.000022386637,0.00005959639,0.000034440433,0.9668655,0.020525599,0.01104812,0.0010020965,0.000008860206],"about_ca_topic_score_codex":0.000894937,"about_ca_topic_score_gemma":0.0019781112,"teacher_disagreement_score":0.0014246473,"about_ca_system_score_codex":0.00060940254,"about_ca_system_score_gemma":0.0012397252,"threshold_uncertainty_score":0.005441129},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017937139,0.0039819824,0.015269514,0.05567149,0.00917135,0.00012851814,0.000987856,0.00364373,0.89320844],"genre_scores_gemma":[0.04728657,0.0019396743,0.008486426,0.013055914,0.0005854785,0.000061029175,0.00074923417,0.0009999663,0.9268358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992818,0.00016525188,0.00001768268,0.00014358181,0.00024985673,0.00014187818],"domain_scores_gemma":[0.9993963,0.00007165585,0.00003862912,0.00009247064,0.00014762301,0.00025331535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084343884,0.0006835509,0.0004950357,0.00072434207,0.004320097,0.0042053857,0.00096020877,0.0018280377,0.20747975],"category_scores_gemma":[0.0020536594,0.0002905498,0.0005729388,0.00066041376,0.0023197134,0.005499702,0.0052921493,0.0029937439,0.09814414],"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.000089701265,0.000086722655,0.0015994669,0.00015134916,0.000023117784,0.0005853576,0.0054015922,0.00007912998,0.0012516774,0.043105703,0.83448595,0.11314023],"study_design_scores_gemma":[0.0000028074162,0.000019344718,0.00040462663,0.000049308983,0.000003980622,0.00027773908,0.0017889983,0.000042131545,0.00014786341,0.0029513477,0.99430287,0.000008978249],"about_ca_topic_score_codex":0.0027943805,"about_ca_topic_score_gemma":0.007250782,"teacher_disagreement_score":0.20747975,"about_ca_system_score_codex":0.0009258355,"about_ca_system_score_gemma":0.0007774086,"threshold_uncertainty_score":0.69408894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070840083,0.00026627284,0.858357,0.00054781,0.0009231427,0.00018143535,0.0039689997,0.098263636,0.030407678],"genre_scores_gemma":[0.11313277,0.0006427071,0.7053943,0.0020659433,0.00049064186,0.0005732931,0.015497716,0.08842838,0.07377425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844486,0.00023280468,0.00017979101,0.00038778863,0.00057806517,0.00017659455],"domain_scores_gemma":[0.9979233,0.0004352958,0.00008629455,0.0010869426,0.00039775184,0.00007036818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597015,0.0010251802,0.0010198826,0.0014427279,0.0008274,0.003328266,0.0018614527,0.0012093196,0.039909296],"category_scores_gemma":[0.00426685,0.0011239579,0.0016869883,0.0014863358,0.0014908562,0.006138857,0.003882429,0.0022903713,0.019874262],"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.00048244154,0.00016769055,0.00245112,0.00077653176,0.00013074765,0.00060315087,0.0011767691,0.006062271,0.012131233,0.42399368,0.21724388,0.33478045],"study_design_scores_gemma":[0.00008176815,0.00007545626,0.0006345716,0.00014980318,0.000072120376,0.00041323615,0.00014638295,0.034042418,0.04102939,0.1989114,0.72432566,0.00011790097],"about_ca_topic_score_codex":0.001486703,"about_ca_topic_score_gemma":0.0021900681,"teacher_disagreement_score":0.039909296,"about_ca_system_score_codex":0.0008397371,"about_ca_system_score_gemma":0.0016000537,"threshold_uncertainty_score":0.13350993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113054715,0.00046702533,0.8801414,0.00012180969,0.000026432,0.00013571924,0.000055505785,0.0044706,0.0015268518],"genre_scores_gemma":[0.74163777,0.00012474258,0.25618508,0.000086234526,0.000045739183,0.00015514519,0.00023176873,0.00041094233,0.0011225195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454534,0.0020081254,0.000400505,0.0012646671,0.0013264852,0.00045493076],"domain_scores_gemma":[0.9832481,0.0076013505,0.0025205675,0.004238648,0.0019209731,0.00047029523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033257345,0.0010830418,0.001237546,0.0018628858,0.00065188645,0.0014080689,0.001900371,0.0007099789,0.0022711665],"category_scores_gemma":[0.011028399,0.0009646758,0.00093026593,0.002090986,0.001938335,0.002882284,0.0028940442,0.0012472846,0.0007253174],"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.0015588903,0.00042016307,0.008929385,0.00043085072,0.00016960765,0.0006921107,0.00055887905,0.13457139,0.19150417,0.01581432,0.0026000554,0.64275026],"study_design_scores_gemma":[0.00018929887,0.0013316966,0.0042702756,0.00007077259,0.00017026592,0.0010041374,0.00009965594,0.8259398,0.1418081,0.021225391,0.003818263,0.00007238441],"about_ca_topic_score_codex":0.0014504554,"about_ca_topic_score_gemma":0.0015023785,"teacher_disagreement_score":0.0033257345,"about_ca_system_score_codex":0.0009087338,"about_ca_system_score_gemma":0.0017718999,"threshold_uncertainty_score":0.017588377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05577358,0.0014459157,0.9162075,0.0008321047,0.00011047101,0.00022273278,0.0010163562,0.014597237,0.00979402],"genre_scores_gemma":[0.44853306,0.0016819121,0.5292708,0.0007559159,0.00018036723,0.00050155405,0.0029364168,0.0071659414,0.008973963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781775,0.00066799996,0.00015773777,0.0002737395,0.00086669036,0.00021614796],"domain_scores_gemma":[0.99430436,0.0038271707,0.000526171,0.0008510913,0.00042495818,0.00006630743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010429552,0.001062189,0.0005361977,0.0028855365,0.0013682102,0.0023724933,0.0011533062,0.0012722125,0.0059899073],"category_scores_gemma":[0.00831351,0.0006952387,0.0019784982,0.0022780178,0.0020072248,0.0034419224,0.0015646792,0.0020366178,0.0009902479],"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.00041480188,0.00016379132,0.006776617,0.0011986732,0.00014427966,0.0008215333,0.0018335774,0.09225058,0.032591414,0.58558714,0.016414693,0.2618029],"study_design_scores_gemma":[0.000051632298,0.000074114134,0.0039316304,0.0002461844,0.0001460883,0.00080600375,0.00032206913,0.20656475,0.019418746,0.6888514,0.07944061,0.00014671884],"about_ca_topic_score_codex":0.0058563924,"about_ca_topic_score_gemma":0.007590003,"teacher_disagreement_score":0.0059899073,"about_ca_system_score_codex":0.0016712905,"about_ca_system_score_gemma":0.0017184607,"threshold_uncertainty_score":0.020038247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31408837,0.00057707494,0.6585927,0.0006560969,0.0002531494,0.00013413932,0.00015295688,0.014836207,0.0107092885],"genre_scores_gemma":[0.8117009,0.00028556256,0.16763617,0.00045065183,0.000058026064,0.00016735437,0.0003205685,0.0023635968,0.017017221],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753845,0.00057494926,0.00014451238,0.0004410299,0.00092127215,0.0003798916],"domain_scores_gemma":[0.98785377,0.0043537538,0.0007986706,0.0049318853,0.0013514939,0.0007104058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032309913,0.0008968385,0.0008102317,0.0007023983,0.0015270363,0.002987484,0.0033802763,0.0017508593,0.004147185],"category_scores_gemma":[0.012428993,0.0010111531,0.00048354708,0.00048737467,0.00278019,0.0058591026,0.006151441,0.0020444558,0.0010856087],"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.0027396416,0.000706551,0.07322098,0.0008796785,0.00032205915,0.0066571613,0.020840703,0.084492505,0.21319027,0.19710079,0.019950802,0.37989888],"study_design_scores_gemma":[0.00019755395,0.0008215448,0.007439159,0.00021661558,0.00036848217,0.0026323765,0.002952021,0.45929545,0.23932347,0.1640163,0.12242998,0.0003070297],"about_ca_topic_score_codex":0.0015108681,"about_ca_topic_score_gemma":0.001663644,"teacher_disagreement_score":0.004147185,"about_ca_system_score_codex":0.0005877648,"about_ca_system_score_gemma":0.00091748306,"threshold_uncertainty_score":0.01708728},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008259182,0.0010334266,0.5820323,0.00085770787,0.00061857904,0.0005827495,0.01563393,0.3038629,0.08711921],"genre_scores_gemma":[0.17120044,0.001430521,0.52276516,0.0023676353,0.00043919648,0.0012015721,0.06380767,0.033882674,0.2029051],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799097,0.00030446364,0.00016974226,0.00062534853,0.0007451755,0.0001642527],"domain_scores_gemma":[0.9977059,0.0005381934,0.0001497565,0.0010766778,0.00045742138,0.00007210555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019903546,0.0013592008,0.0007938687,0.0019463698,0.0008180084,0.0024524436,0.0020938464,0.0010895706,0.08191858],"category_scores_gemma":[0.004865339,0.00097614335,0.0010111434,0.0010020207,0.00076390133,0.004558106,0.0034725976,0.0016870335,0.03729616],"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.0010003182,0.00022604529,0.0065475744,0.0009752304,0.00015234649,0.00038268356,0.00037580123,0.0072090426,0.017093133,0.08713165,0.2787386,0.6001676],"study_design_scores_gemma":[0.00020700133,0.0001771757,0.0026287693,0.00014974784,0.00009267982,0.0004622486,0.000114095776,0.08798008,0.042300835,0.06902467,0.7967709,0.00009183394],"about_ca_topic_score_codex":0.0027148523,"about_ca_topic_score_gemma":0.0036934232,"teacher_disagreement_score":0.08191858,"about_ca_system_score_codex":0.0012056613,"about_ca_system_score_gemma":0.001595587,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007987701,0.0001349223,0.98194593,0.00019015356,0.00006682763,0.00024244613,0.00087710464,0.0035352998,0.005019528],"genre_scores_gemma":[0.19752264,0.00051078753,0.78980225,0.00031873494,0.0001276303,0.00075503765,0.003447308,0.0013633808,0.0061522494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994474,0.000694861,0.00045056417,0.0011813622,0.0026213941,0.0005777342],"domain_scores_gemma":[0.9894488,0.0056226286,0.0010431525,0.002129681,0.0016140771,0.00014175684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028039692,0.0012719018,0.00078408926,0.0032494487,0.0013215389,0.002337967,0.0027330716,0.0013481227,0.008930077],"category_scores_gemma":[0.014975386,0.0009156644,0.0030142227,0.0016551095,0.0025543664,0.006534007,0.0031482186,0.002803004,0.0022903036],"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.0003313589,0.00018056376,0.005438176,0.00091190636,0.00014075858,0.0010083161,0.00091859105,0.054965485,0.017726505,0.690479,0.011564238,0.21633506],"study_design_scores_gemma":[0.00008491321,0.0001970687,0.0017735617,0.00024874805,0.0002703215,0.0007713187,0.00023943186,0.23673372,0.059956722,0.6312364,0.0683504,0.0001374455],"about_ca_topic_score_codex":0.0025946999,"about_ca_topic_score_gemma":0.0024822163,"teacher_disagreement_score":0.008930077,"about_ca_system_score_codex":0.0015417014,"about_ca_system_score_gemma":0.0025710894,"threshold_uncertainty_score":0.029874146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13973717,0.0003199511,0.8532474,0.00014234037,0.00003738298,0.00010554208,0.00006458054,0.004470259,0.0018754359],"genre_scores_gemma":[0.6797939,0.00007957135,0.31834242,0.000075020886,0.000014477012,0.000097181975,0.00012660783,0.00039777253,0.0010730275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911016,0.0003393255,0.00006023206,0.00013906871,0.00022668736,0.00012452826],"domain_scores_gemma":[0.9975688,0.0011650502,0.00022443624,0.00072036084,0.00024131988,0.00008003497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014487408,0.0008098789,0.0007066898,0.0006985139,0.00046725853,0.00066150894,0.0014219838,0.00048560413,0.0013334309],"category_scores_gemma":[0.0042681857,0.00039505662,0.0005988491,0.0006841831,0.00089701667,0.0013809536,0.001301344,0.0010146198,0.00022873272],"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.00064057915,0.0002526946,0.0047870283,0.00023694005,0.00006740196,0.00019024203,0.00047583057,0.5230118,0.07079578,0.017082475,0.0021542686,0.380305],"study_design_scores_gemma":[0.000025683481,0.00011767477,0.00035240623,0.000011716084,0.00001749381,0.000038453018,0.00003503275,0.9749435,0.015817305,0.007793011,0.00083591894,0.000011736885],"about_ca_topic_score_codex":0.0011647391,"about_ca_topic_score_gemma":0.0021373548,"teacher_disagreement_score":0.0014487408,"about_ca_system_score_codex":0.00057016296,"about_ca_system_score_gemma":0.0008268704,"threshold_uncertainty_score":0.00766176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020914655,0.0010952422,0.3771064,0.0006671492,0.0010417956,0.0007473302,0.006208169,0.34782654,0.24439268],"genre_scores_gemma":[0.20276774,0.0013240958,0.20453699,0.0020017184,0.0003167263,0.00090031343,0.021448424,0.045992516,0.52071154],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953437,0.00003711215,0.000026503563,0.00013143115,0.00018837975,0.00008229074],"domain_scores_gemma":[0.99929786,0.0001264899,0.00003982953,0.00028918643,0.00016370663,0.000083037135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041476978,0.0013029849,0.0004677706,0.00058273063,0.00037355802,0.0013203815,0.0019453659,0.00076634716,0.118237175],"category_scores_gemma":[0.0013860051,0.00062894076,0.0005373386,0.0003821414,0.00026819424,0.0019958843,0.0023651416,0.0011603058,0.060139034],"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.0013711634,0.00021171775,0.003024993,0.00064705336,0.00007148978,0.00045196616,0.0005443271,0.0025884009,0.049975,0.014388047,0.387126,0.53959984],"study_design_scores_gemma":[0.00019159805,0.0002581649,0.002416993,0.00009974285,0.000056291654,0.00052951183,0.00011734481,0.025171597,0.040994823,0.0067143557,0.9233703,0.00007918169],"about_ca_topic_score_codex":0.0011878535,"about_ca_topic_score_gemma":0.0023370497,"teacher_disagreement_score":0.118237175,"about_ca_system_score_codex":0.00022822146,"about_ca_system_score_gemma":0.0005158525,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008442085,0.0000454047,0.99840707,0.000040904102,0.000013604625,0.00003073162,0.000006047676,0.00009025637,0.00052179786],"genre_scores_gemma":[0.06192874,0.00014914299,0.9353109,0.00008552808,0.000034632485,0.0002810564,0.00004061148,0.00011434558,0.0020550129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991394,0.00030481603,0.000030473244,0.000112250564,0.00033707736,0.000075914584],"domain_scores_gemma":[0.99936527,0.00038696543,0.00006582824,0.000049367813,0.000108541,0.000024025738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014540829,0.0015906382,0.00087045826,0.0010047398,0.00069072907,0.0007195028,0.0013455958,0.0009945896,0.0025340216],"category_scores_gemma":[0.0024863984,0.0009346878,0.0012875838,0.0010734848,0.00092174794,0.00086292345,0.0011197174,0.0021124692,0.0006376766],"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.000081010796,0.00010540849,0.00023934817,0.00018245986,0.000059238646,0.00008761001,0.00015031571,0.81696737,0.013568121,0.036665455,0.0022928917,0.12960075],"study_design_scores_gemma":[0.000031937398,0.00011804689,0.00012199254,0.0000204854,0.000021982762,0.00005898645,0.000018548788,0.9805398,0.004058104,0.011536675,0.003457967,0.000015487678],"about_ca_topic_score_codex":0.0030774975,"about_ca_topic_score_gemma":0.0038758733,"teacher_disagreement_score":0.0030774975,"about_ca_system_score_codex":0.001062409,"about_ca_system_score_gemma":0.0018184452,"threshold_uncertainty_score":0.008477151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051753566,0.0002987987,0.92674917,0.00064386823,0.00003401278,0.00017586639,0.00035142197,0.0011057815,0.01888755],"genre_scores_gemma":[0.55432534,0.0005653158,0.4301705,0.0002344683,0.00007638971,0.000746325,0.00071081094,0.00078402756,0.012386748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998362,0.00042434,0.000099663426,0.00026681897,0.00059580605,0.00025149155],"domain_scores_gemma":[0.9974022,0.0013942308,0.00032011484,0.0003538273,0.00044876477,0.00008100921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016400504,0.00071726687,0.00054994156,0.0010969427,0.0006829284,0.002057544,0.002843698,0.00117703,0.004201264],"category_scores_gemma":[0.006109219,0.00065276114,0.0016079617,0.00089539343,0.0022010219,0.003279474,0.0017071359,0.0018780447,0.0005063559],"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.000032723434,0.00007846942,0.00092489866,0.00011445861,0.000023572815,0.00018386694,0.00029894485,0.4154593,0.0022912857,0.5707472,0.0010183409,0.008827003],"study_design_scores_gemma":[0.000012967099,0.000014588633,0.00012725835,0.000018386583,0.000009959444,0.000038651076,0.000037063477,0.8784391,0.0012698557,0.11585304,0.0041697645,0.000009404571],"about_ca_topic_score_codex":0.009808863,"about_ca_topic_score_gemma":0.0062090317,"teacher_disagreement_score":0.009808863,"about_ca_system_score_codex":0.002280134,"about_ca_system_score_gemma":0.0028537146,"threshold_uncertainty_score":0.019503534},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041844044,0.005125334,0.027104054,0.014407073,0.06103088,0.0007470482,0.0071402797,0.005919958,0.87434095],"genre_scores_gemma":[0.016394671,0.0020381606,0.008935773,0.002821358,0.0060552894,0.00023100154,0.0071104886,0.0013509623,0.9550624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872667,0.0001711014,0.00008474764,0.0004079571,0.000444167,0.00016532317],"domain_scores_gemma":[0.99738723,0.00028147904,0.000080373065,0.0004924161,0.0010500528,0.00070841267],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013669664,0.0010348965,0.0007775579,0.0013989573,0.002321978,0.0049791243,0.0018751106,0.0022017518,0.61200416],"category_scores_gemma":[0.00331794,0.00047346848,0.0010036277,0.0010132302,0.0005995741,0.003553495,0.0031701184,0.0025155882,0.39293373],"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.00023020084,0.0001229548,0.00036479186,0.00022145631,0.000018213432,0.00016078165,0.000092861796,0.00024201482,0.0015933772,0.01109447,0.87365234,0.11220648],"study_design_scores_gemma":[0.000028697877,0.000037339676,0.0002976361,0.00006501184,0.000010203018,0.00016859507,0.000079131205,0.0003305575,0.0007124078,0.004631946,0.99362844,0.000009984722],"about_ca_topic_score_codex":0.0010795564,"about_ca_topic_score_gemma":0.0021568255,"teacher_disagreement_score":0.38799584,"about_ca_system_score_codex":0.0013575908,"about_ca_system_score_gemma":0.0014697725,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008725762,0.00010653297,0.9883739,0.00013478208,0.000017647302,0.00003297881,0.00008205001,0.0017076059,0.0008188027],"genre_scores_gemma":[0.33959338,0.00028720126,0.6565861,0.00017164182,0.00011017758,0.00020762839,0.0002824127,0.0005887909,0.0021726517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981806,0.00039382084,0.0000904137,0.00027375677,0.000946723,0.0001146951],"domain_scores_gemma":[0.99546415,0.0023856927,0.0004378636,0.0009376742,0.00070860854,0.00006608101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016973523,0.00095264177,0.00076004275,0.0024704246,0.0012412646,0.0014943457,0.0017184927,0.0009013175,0.0025699316],"category_scores_gemma":[0.013014352,0.00090858666,0.0010187747,0.001891447,0.0011828103,0.0034189522,0.001601636,0.0017570542,0.0007742381],"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.0002654589,0.000099672856,0.005429986,0.00014272127,0.000078662575,0.0001245912,0.0001974962,0.456233,0.017181246,0.22799784,0.004841596,0.28740776],"study_design_scores_gemma":[0.000006769505,0.0000231615,0.0002487269,0.000009895367,0.000016729458,0.000027948654,0.0000066688326,0.95226973,0.0027822414,0.04314847,0.0014426332,0.000017048715],"about_ca_topic_score_codex":0.0037174642,"about_ca_topic_score_gemma":0.0038214307,"teacher_disagreement_score":0.0037174642,"about_ca_system_score_codex":0.0012301052,"about_ca_system_score_gemma":0.0033879345,"threshold_uncertainty_score":0.008976519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061546456,0.0005105333,0.8759321,0.00042857512,0.00012255136,0.000056734734,0.00017114541,0.029108874,0.03212308],"genre_scores_gemma":[0.51528007,0.00031896622,0.4610952,0.0003669735,0.000075915894,0.00013715505,0.00060538505,0.006143877,0.015976382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999154,0.00015538374,0.000053085405,0.00011631568,0.0003667591,0.00015443927],"domain_scores_gemma":[0.9985869,0.00066712074,0.00012656394,0.0003084991,0.00026417768,0.00004683286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065522006,0.0008481931,0.00043469784,0.0005689069,0.000415637,0.0011717778,0.0012681705,0.00048734702,0.008028083],"category_scores_gemma":[0.004149732,0.00036461075,0.00054320216,0.0005484183,0.0007181389,0.0013609844,0.0012639734,0.0008085238,0.002744937],"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.0008311805,0.00019633987,0.005708799,0.000558154,0.00007913172,0.00063639664,0.00048324413,0.31890965,0.06789628,0.08160189,0.0242568,0.49884206],"study_design_scores_gemma":[0.00010315276,0.00013062483,0.0010568952,0.00006781588,0.00004567939,0.00037798917,0.00011282147,0.86989355,0.07007718,0.012873245,0.045217607,0.000043383003],"about_ca_topic_score_codex":0.0020916625,"about_ca_topic_score_gemma":0.0036298232,"teacher_disagreement_score":0.008028083,"about_ca_system_score_codex":0.0007204895,"about_ca_system_score_gemma":0.0011523057,"threshold_uncertainty_score":0.02685666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2609519,0.00040078288,0.7037533,0.0003003071,0.0000737008,0.00013775479,0.0000876791,0.030669995,0.003624522],"genre_scores_gemma":[0.91281635,0.00006859823,0.084312506,0.0001632861,0.000015123106,0.000052391882,0.00011552698,0.00082646485,0.0016298838],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960658,0.00097137806,0.00016846007,0.00060154457,0.0017313135,0.00046145715],"domain_scores_gemma":[0.9853631,0.0034143245,0.0019400191,0.0076042553,0.0012751014,0.00040320432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020274026,0.0006060745,0.0005124999,0.0006311929,0.00056027883,0.001367109,0.0020105795,0.00095105247,0.0012388699],"category_scores_gemma":[0.010236169,0.00056966866,0.00042404298,0.00029191002,0.001945128,0.0022206255,0.002436357,0.001463664,0.00044926148],"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.0013623422,0.00048197992,0.048956305,0.00038251287,0.00012858935,0.0016044286,0.0031388453,0.070081465,0.37421942,0.03620614,0.008638418,0.45479956],"study_design_scores_gemma":[0.00006678241,0.0007121124,0.012282867,0.0001027182,0.00006371419,0.0010898992,0.00031397227,0.53030854,0.40984127,0.025641156,0.019499505,0.00007753458],"about_ca_topic_score_codex":0.001365446,"about_ca_topic_score_gemma":0.0012850924,"teacher_disagreement_score":0.0020274026,"about_ca_system_score_codex":0.0009179303,"about_ca_system_score_gemma":0.0012139555,"threshold_uncertainty_score":0.010722101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006230466,0.00019011727,0.9691027,0.0007406811,0.00014075704,0.0000888139,0.00007009896,0.000923618,0.022512667],"genre_scores_gemma":[0.45712024,0.00053201086,0.5068493,0.00067930826,0.00030277212,0.00036701295,0.00019548746,0.0004420461,0.033511862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647576,0.0011901521,0.00017391177,0.000793739,0.00095572975,0.00041066515],"domain_scores_gemma":[0.9949727,0.0024914984,0.00035374388,0.0012095207,0.00071421504,0.00025825892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004738145,0.0006952851,0.0004463428,0.0008336981,0.001775247,0.0034866752,0.00225585,0.0011091639,0.007078278],"category_scores_gemma":[0.010682287,0.00048812624,0.0010990028,0.0006622422,0.0053194896,0.0045345556,0.0026742457,0.0019640985,0.0009936151],"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.00001643497,0.000012622754,0.00012490379,0.000028818453,0.0000071480827,0.00004758229,0.00017576218,0.008050848,0.00065502356,0.97891176,0.00074504374,0.011224096],"study_design_scores_gemma":[0.000021952636,0.000026740354,0.00005734002,0.0000277668,0.000023179904,0.00007283812,0.00006194946,0.057446152,0.0024769637,0.91629636,0.023473999,0.000014654238],"about_ca_topic_score_codex":0.003144605,"about_ca_topic_score_gemma":0.0036937322,"teacher_disagreement_score":0.007078278,"about_ca_system_score_codex":0.0022693705,"about_ca_system_score_gemma":0.0029327353,"threshold_uncertainty_score":0.025058031},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027631873,0.00019445659,0.9594498,0.00024763783,0.000057562447,0.00022506218,0.0001139705,0.0069183353,0.0051613366],"genre_scores_gemma":[0.33328068,0.0003523143,0.65318954,0.00038976522,0.000124445,0.00035952564,0.0006717966,0.0020307824,0.009601139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955646,0.00079503126,0.00033417792,0.0007097043,0.0020864531,0.00051008875],"domain_scores_gemma":[0.98771906,0.0031163709,0.0006385152,0.0066314368,0.0016769017,0.000217694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035120542,0.0008149271,0.0008003131,0.0011599897,0.0007868632,0.0022780935,0.0031740374,0.0007131104,0.0023490642],"category_scores_gemma":[0.014054494,0.0009014381,0.0016036456,0.0013942483,0.0017814059,0.005643889,0.0050544823,0.0021773125,0.0006564698],"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.00047618645,0.00041772856,0.012493153,0.00044440475,0.00018619369,0.00068666256,0.0031953508,0.037202213,0.048654255,0.24480705,0.010457646,0.6409792],"study_design_scores_gemma":[0.00020372607,0.0005531773,0.00722509,0.00016212744,0.00067010114,0.0011026305,0.0007964986,0.4537744,0.13252889,0.2731582,0.12958108,0.00024415954],"about_ca_topic_score_codex":0.0044168388,"about_ca_topic_score_gemma":0.004840214,"teacher_disagreement_score":0.0044168388,"about_ca_system_score_codex":0.0010180993,"about_ca_system_score_gemma":0.0020531972,"threshold_uncertainty_score":0.018573761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005822416,0.00074731256,0.984083,0.00050318026,0.000085839936,0.000060492494,0.00005310156,0.0018192517,0.0068253893],"genre_scores_gemma":[0.18367325,0.0015131165,0.8055078,0.00030168923,0.00017848791,0.0003818761,0.00024603863,0.0009656671,0.007232091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960174,0.0012157023,0.00041145628,0.000597029,0.0014668448,0.00029154378],"domain_scores_gemma":[0.9953471,0.0016303106,0.0003945856,0.0019735997,0.00053089747,0.000123585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031884187,0.00062736083,0.00067715487,0.0013600069,0.0015491734,0.0038312695,0.0017111714,0.0014570922,0.0033800965],"category_scores_gemma":[0.009408439,0.000861306,0.0013788358,0.0021444927,0.0035235423,0.0047111106,0.0034081533,0.0037369838,0.0012950667],"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.000030568248,0.000013252048,0.00038217366,0.000096392636,0.000013992589,0.00012444324,0.00035330976,0.015658488,0.0028514313,0.9301305,0.0024301128,0.04791528],"study_design_scores_gemma":[0.000032775246,0.00005507004,0.0002622176,0.00011759585,0.000038811555,0.0005475862,0.000101019185,0.07360925,0.004835843,0.80494237,0.115400754,0.000056729197],"about_ca_topic_score_codex":0.0017237343,"about_ca_topic_score_gemma":0.0017315891,"teacher_disagreement_score":0.0038312695,"about_ca_system_score_codex":0.00194815,"about_ca_system_score_gemma":0.0019843765,"threshold_uncertainty_score":0.016862154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16197336,0.0025571303,0.7460136,0.000830621,0.00084993185,0.00026478502,0.0013560685,0.05427943,0.031875145],"genre_scores_gemma":[0.8741291,0.0012460924,0.10246206,0.00057568407,0.000188157,0.0002830007,0.0020505586,0.0015365916,0.017528607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999228,0.00014216661,0.000053289456,0.000119862285,0.00028061023,0.00017610837],"domain_scores_gemma":[0.99838626,0.00039801683,0.00009794276,0.0007771676,0.0002300539,0.00011056018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325235,0.00061183603,0.00054762856,0.0003532656,0.0004278518,0.0013884988,0.0019058915,0.00034551893,0.007674374],"category_scores_gemma":[0.0030938718,0.000457438,0.00039006898,0.0004557267,0.00040828573,0.002150374,0.0018432207,0.0013431995,0.0020420018],"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.0022690643,0.00058274844,0.019896407,0.00068645395,0.0003336489,0.0009612608,0.00072035287,0.14240634,0.09857352,0.124453686,0.087105915,0.5220106],"study_design_scores_gemma":[0.00017147603,0.00061651744,0.0028868252,0.00009063909,0.00018066679,0.00067325745,0.00017638018,0.63522255,0.16095513,0.033627838,0.16527347,0.0001252573],"about_ca_topic_score_codex":0.0013831768,"about_ca_topic_score_gemma":0.0016393547,"teacher_disagreement_score":0.007674374,"about_ca_system_score_codex":0.0004972203,"about_ca_system_score_gemma":0.0018390074,"threshold_uncertainty_score":0.02567333},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01662927,0.00775164,0.021781497,0.013437754,0.008354317,0.0010611268,0.011504678,0.0037552791,0.9157245],"genre_scores_gemma":[0.05202114,0.005528496,0.019193431,0.005077045,0.00095467694,0.0006975273,0.014984019,0.0015395536,0.9000042],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721366,0.00043238353,0.0002032851,0.00057384715,0.0011526346,0.0004241614],"domain_scores_gemma":[0.99585694,0.00035500797,0.00011989229,0.0005569175,0.0017409709,0.0013702117],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027946944,0.0009199761,0.0007106067,0.0020202864,0.0026261103,0.003872636,0.0021804287,0.0018135305,0.3760718],"category_scores_gemma":[0.006661749,0.00035218068,0.0009339258,0.001854209,0.00068906986,0.0030509878,0.00459394,0.0020877975,0.22552878],"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.00036388787,0.0005678958,0.003872765,0.00041025327,0.000027234522,0.0011126683,0.0013547865,0.00030558967,0.0015625844,0.0145588415,0.5354285,0.44043493],"study_design_scores_gemma":[0.000020815698,0.00010016091,0.0010390107,0.00012799504,0.000010824127,0.0008468504,0.0005795481,0.000120882585,0.00048576618,0.0016914716,0.99495935,0.000017400758],"about_ca_topic_score_codex":0.005489889,"about_ca_topic_score_gemma":0.009673856,"teacher_disagreement_score":0.3760718,"about_ca_system_score_codex":0.0017529798,"about_ca_system_score_gemma":0.004781304,"threshold_uncertainty_score":0.88995785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02883905,0.0023023968,0.4340079,0.0018636597,0.0018875891,0.0011365595,0.0032914833,0.14913559,0.37753576],"genre_scores_gemma":[0.30993247,0.0023805057,0.28023928,0.0029722617,0.0005998733,0.0010809852,0.016772734,0.023819964,0.3622018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.00019982363,0.00008566387,0.00025553495,0.00090389873,0.00028667206],"domain_scores_gemma":[0.99864787,0.00018761949,0.000084596824,0.0002780839,0.0005812272,0.0002205972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009831242,0.0008780341,0.0004797781,0.0007642574,0.00070507394,0.002551564,0.0020545598,0.0007371279,0.050525613],"category_scores_gemma":[0.0020776254,0.000566813,0.00047274513,0.0006061011,0.00070872594,0.0024744114,0.0022494304,0.0017123357,0.022557901],"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.0020007426,0.0004929464,0.00411709,0.001333242,0.00011359792,0.00067990285,0.001082348,0.013740128,0.04618823,0.1383218,0.35139933,0.4405307],"study_design_scores_gemma":[0.00010103476,0.00030319204,0.00051402545,0.00006414136,0.000027928947,0.00043540171,0.00009523162,0.022030797,0.020875838,0.004854335,0.9506431,0.000055022032],"about_ca_topic_score_codex":0.0019094534,"about_ca_topic_score_gemma":0.0030268172,"teacher_disagreement_score":0.050525613,"about_ca_system_score_codex":0.0009932341,"about_ca_system_score_gemma":0.001711115,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032180117,0.00032038076,0.99427265,0.00031834806,0.00003237777,0.000054739223,0.000047581216,0.00022018795,0.0015158359],"genre_scores_gemma":[0.22798774,0.0015238263,0.7665526,0.00042592484,0.00030171472,0.00037642152,0.0004350843,0.000117897565,0.0022787508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952833,0.0015658046,0.0003394174,0.0008685291,0.0016292036,0.0003137039],"domain_scores_gemma":[0.9912322,0.0067778802,0.0005679194,0.0007765099,0.00049659394,0.00014883504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027099808,0.0017384181,0.0015086232,0.0029496846,0.00089147285,0.0026994017,0.001789856,0.001760645,0.0033796658],"category_scores_gemma":[0.010917738,0.0007918869,0.0027772645,0.0018122697,0.004341347,0.005986995,0.0028380598,0.003802406,0.00056694215],"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.00015555181,0.00012159946,0.0010447638,0.00057459,0.000108314336,0.00033935727,0.0003023182,0.25892746,0.0048778895,0.60330135,0.0020527388,0.12819415],"study_design_scores_gemma":[0.00005711504,0.000085015825,0.00019976862,0.00008624649,0.00004323296,0.00013368785,0.000050725295,0.4927818,0.0020542834,0.500015,0.0044668945,0.000026236725],"about_ca_topic_score_codex":0.0031459793,"about_ca_topic_score_gemma":0.0018393575,"teacher_disagreement_score":0.0033796658,"about_ca_system_score_codex":0.002216937,"about_ca_system_score_gemma":0.0022741498,"threshold_uncertainty_score":0.016085088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027315639,0.000050009286,0.9685508,0.000074906486,0.000024288258,0.000058316422,0.000114399925,0.001113651,0.0026980278],"genre_scores_gemma":[0.49684253,0.00014335867,0.4948872,0.00011357641,0.00004644788,0.00021885619,0.0005187116,0.00072665996,0.006502674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968587,0.00046318342,0.00020861611,0.00048773878,0.0015685157,0.00041313472],"domain_scores_gemma":[0.9958691,0.0015982755,0.0004496833,0.0009227404,0.001029621,0.0001304683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025396806,0.00059997773,0.000689959,0.0019047699,0.0012127889,0.0032251673,0.0020717748,0.0010867412,0.0037612945],"category_scores_gemma":[0.008007819,0.0007225282,0.0019012013,0.0012212134,0.0026229688,0.0052482532,0.0026119393,0.0017897418,0.0005865082],"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.00022155757,0.000074099196,0.0067196754,0.0002030933,0.00007309678,0.0007786245,0.0011217936,0.12723246,0.018616052,0.77508074,0.0012320586,0.06864678],"study_design_scores_gemma":[0.000025714573,0.00009617182,0.00078485557,0.000063469735,0.00007605619,0.00038289165,0.00031960747,0.52647185,0.049820516,0.40074053,0.02114626,0.00007200114],"about_ca_topic_score_codex":0.0051292544,"about_ca_topic_score_gemma":0.0029123293,"teacher_disagreement_score":0.0051292544,"about_ca_system_score_codex":0.0019966967,"about_ca_system_score_gemma":0.001970614,"threshold_uncertainty_score":0.014487088},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012989971,0.0010268037,0.87229145,0.0006548755,0.00083416037,0.000106914806,0.0016304513,0.07996353,0.04219278],"genre_scores_gemma":[0.04710884,0.0035924294,0.82272327,0.0017824308,0.00096126605,0.00090137013,0.007635186,0.050424438,0.06487085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966061,0.000731301,0.00037299958,0.00052413146,0.0015472942,0.00021814114],"domain_scores_gemma":[0.9929027,0.0026135994,0.00045439988,0.00185557,0.0018838422,0.0002898839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023340287,0.0014542976,0.00086701923,0.002503319,0.000700841,0.0032633492,0.0029265916,0.0011094777,0.10896308],"category_scores_gemma":[0.018341472,0.0007881637,0.0012039269,0.0014193422,0.0011218741,0.003494532,0.003737433,0.0030185878,0.07200311],"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.00029853266,0.00006190204,0.0010214866,0.0010745818,0.00007727137,0.0007666152,0.0005643229,0.009732965,0.013635273,0.13920084,0.252165,0.5814012],"study_design_scores_gemma":[0.000059680908,0.00005628553,0.00040896126,0.00029896598,0.000029317996,0.0009331018,0.000067146626,0.024362395,0.01804285,0.053680573,0.90199506,0.00006585744],"about_ca_topic_score_codex":0.0006983788,"about_ca_topic_score_gemma":0.0009117237,"teacher_disagreement_score":0.10896308,"about_ca_system_score_codex":0.000685511,"about_ca_system_score_gemma":0.001354183,"threshold_uncertainty_score":0.3645178},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06709051,0.00023467478,0.86286944,0.00016979217,0.00008050178,0.00017260983,0.00017362501,0.062320054,0.006888716],"genre_scores_gemma":[0.7261065,0.00020272116,0.2628892,0.00032047706,0.000049492974,0.00023317136,0.00044757995,0.0052200644,0.0045307595],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980615,0.0003474333,0.0001560932,0.00034165903,0.0007563064,0.00033700603],"domain_scores_gemma":[0.99535537,0.0013528679,0.00044297086,0.002096974,0.00061986025,0.0001320184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121476,0.0007399159,0.0006501569,0.0011331349,0.00059815694,0.0014716471,0.0014472124,0.0006142907,0.0032875156],"category_scores_gemma":[0.0070117055,0.0006895465,0.00054335,0.0005792517,0.0012031049,0.002605903,0.0030574126,0.0013311101,0.0014035264],"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.0010317981,0.0006265738,0.019904017,0.0007354355,0.00012664968,0.0012422334,0.0022795282,0.041108787,0.20679316,0.08725173,0.018057957,0.62084204],"study_design_scores_gemma":[0.00013922372,0.0005791641,0.0072514256,0.0001908239,0.00015335435,0.0014911185,0.00024507393,0.3487868,0.51846796,0.047598254,0.074901275,0.00019556],"about_ca_topic_score_codex":0.00075173465,"about_ca_topic_score_gemma":0.0007074943,"teacher_disagreement_score":0.0032875156,"about_ca_system_score_codex":0.00082562683,"about_ca_system_score_gemma":0.0013257673,"threshold_uncertainty_score":0.010997891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09012648,0.00088894635,0.89906615,0.00035872552,0.00006436976,0.00020065898,0.00006282505,0.007430081,0.0018018036],"genre_scores_gemma":[0.62451667,0.00039466785,0.37229887,0.00018886953,0.0000500306,0.00021835532,0.00015598084,0.0006296281,0.0015469142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917191,0.0027836412,0.0006113784,0.00088742864,0.0032643313,0.00073409814],"domain_scores_gemma":[0.9660711,0.016003339,0.0040738806,0.010812252,0.0023925528,0.0006469344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521514,0.0011729085,0.001134531,0.0018268193,0.00089388585,0.0016493221,0.0026033933,0.0010303942,0.0015277249],"category_scores_gemma":[0.02452837,0.0007713153,0.00051884446,0.0019716246,0.0016713955,0.004653025,0.0025837314,0.0016377526,0.00044377564],"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.0035660474,0.0005975631,0.015147463,0.00053993234,0.0001119609,0.00037567015,0.0013412285,0.122746944,0.13548961,0.044923823,0.0034585767,0.67170113],"study_design_scores_gemma":[0.00015160018,0.00053882773,0.0026127785,0.00008397745,0.00009162146,0.00032910015,0.000141745,0.8533442,0.11812549,0.0194097,0.0050891857,0.00008174449],"about_ca_topic_score_codex":0.0024263773,"about_ca_topic_score_gemma":0.002943942,"teacher_disagreement_score":0.003521514,"about_ca_system_score_codex":0.0015109011,"about_ca_system_score_gemma":0.0025097425,"threshold_uncertainty_score":0.01862377},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013467266,0.0049186544,0.06124442,0.009451624,0.030504804,0.0009849137,0.007464617,0.009879349,0.8620843],"genre_scores_gemma":[0.061582386,0.0030558358,0.03494866,0.0048681353,0.0034725363,0.00049040077,0.012938194,0.0022347562,0.87640905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859387,0.00021377798,0.00008101091,0.00037339443,0.00056660845,0.00017122735],"domain_scores_gemma":[0.99825245,0.0002539968,0.000073668016,0.0004062769,0.00061508425,0.00039853546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012967545,0.00066608307,0.0005173491,0.0010306112,0.0018852483,0.0047722817,0.0017352857,0.0016906849,0.37432846],"category_scores_gemma":[0.003194148,0.00030475532,0.0006291524,0.00090312096,0.00052159675,0.0034236736,0.0032307566,0.0016857137,0.18821216],"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.00048004807,0.0002524873,0.0014054208,0.0005947035,0.000031835323,0.00044306886,0.00033895366,0.0011038542,0.006341668,0.036126662,0.66191703,0.29096428],"study_design_scores_gemma":[0.00003103142,0.00008413852,0.00046168015,0.000077438,0.000010614789,0.00027471257,0.00017630868,0.0007521711,0.0022699598,0.004290399,0.9915559,0.000015569465],"about_ca_topic_score_codex":0.0009453389,"about_ca_topic_score_gemma":0.0016109172,"teacher_disagreement_score":0.6256715,"about_ca_system_score_codex":0.00082258816,"about_ca_system_score_gemma":0.0010993341,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028547526,0.00044311793,0.5921609,0.00078363804,0.00038962072,0.0004233433,0.0066563985,0.3349471,0.061341066],"genre_scores_gemma":[0.049709037,0.0017705183,0.6481323,0.0020440982,0.0005684411,0.0027621298,0.035595454,0.13901997,0.12039804],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887484,0.0001683751,0.00010682942,0.00015485103,0.0004931138,0.00020202217],"domain_scores_gemma":[0.99629897,0.00087365304,0.00016413192,0.0012880504,0.0010252617,0.0003499962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014207405,0.0014617564,0.0010580583,0.0015685814,0.0011994519,0.002350164,0.00445858,0.0009241267,0.11818675],"category_scores_gemma":[0.00906052,0.001991428,0.0012323409,0.002104405,0.0006417368,0.005150753,0.0051210294,0.0034974506,0.09195952],"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.00033455068,0.00012628238,0.0007850437,0.00076800433,0.000042741704,0.00039371275,0.0004278536,0.0018506001,0.007785955,0.02886023,0.68365574,0.27496922],"study_design_scores_gemma":[0.00020533864,0.00008204593,0.0011878576,0.0002746925,0.000045237317,0.0008227814,0.000129461,0.02155977,0.013178333,0.033695713,0.92870903,0.00010990388],"about_ca_topic_score_codex":0.0020221388,"about_ca_topic_score_gemma":0.0028002064,"teacher_disagreement_score":0.11818675,"about_ca_system_score_codex":0.00068562204,"about_ca_system_score_gemma":0.0027020602,"threshold_uncertainty_score":0.39537406},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07777094,0.0044689965,0.5811351,0.0021144287,0.0007705674,0.002741281,0.18872325,0.09072962,0.051545843],"genre_scores_gemma":[0.20984182,0.0026160302,0.46719787,0.00050788035,0.00024153078,0.0014693455,0.28916568,0.004101613,0.02485814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772316,0.00021004124,0.00025809213,0.0007978112,0.0008138314,0.00019704884],"domain_scores_gemma":[0.9967913,0.0011802384,0.000317646,0.0008050914,0.0007631646,0.00014258521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016134459,0.0016977417,0.0007984202,0.00577401,0.0011453361,0.0024950646,0.0026437454,0.0010449393,0.011393719],"category_scores_gemma":[0.008783263,0.00057676947,0.0016378983,0.0038491918,0.00043556583,0.0020857381,0.0015164743,0.0015219286,0.009058696],"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.00066514325,0.0005056896,0.04117485,0.0021955422,0.00036760874,0.0017125035,0.00052138924,0.02272293,0.01118496,0.025697453,0.2313323,0.6619196],"study_design_scores_gemma":[0.00017645274,0.00023051335,0.022196036,0.0006707806,0.00031485755,0.0023369058,0.0008780307,0.33137438,0.03590879,0.056175347,0.5496068,0.00013113617],"about_ca_topic_score_codex":0.0042606154,"about_ca_topic_score_gemma":0.008173757,"teacher_disagreement_score":0.011393719,"about_ca_system_score_codex":0.0007005993,"about_ca_system_score_gemma":0.0030914268,"threshold_uncertainty_score":0.0381158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069738016,0.00012354832,0.9250079,0.0004618524,0.000020924192,0.00027292178,0.00033418703,0.0015089035,0.002531672],"genre_scores_gemma":[0.5955737,0.0001426893,0.3999506,0.00024650127,0.00007186455,0.0006179281,0.0011523436,0.0005613131,0.0016830909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98567814,0.003980532,0.0010176556,0.0026850011,0.005210416,0.001428286],"domain_scores_gemma":[0.947209,0.03982827,0.003315804,0.0042537497,0.004803914,0.0005892582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008956115,0.00105722,0.0010370718,0.0025028107,0.0014886063,0.002777966,0.0029420096,0.0011759985,0.0026841238],"category_scores_gemma":[0.04247518,0.0011023853,0.002837366,0.0015963339,0.004597339,0.0035778282,0.0029441717,0.003103862,0.00035012167],"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.00086849445,0.00036891885,0.02092052,0.00072993257,0.00046869591,0.0009260306,0.0019300907,0.4179458,0.0123364255,0.45121428,0.0021986063,0.090092115],"study_design_scores_gemma":[0.00011646042,0.00017224968,0.0012811484,0.0000980797,0.0001905994,0.00014155745,0.000238847,0.66062033,0.019395579,0.3136557,0.0040404866,0.000048976686],"about_ca_topic_score_codex":0.004596481,"about_ca_topic_score_gemma":0.0023056704,"teacher_disagreement_score":0.008956115,"about_ca_system_score_codex":0.0024236343,"about_ca_system_score_gemma":0.0041984385,"threshold_uncertainty_score":0.04736507},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028272907,0.002047188,0.076546475,0.0019489141,0.0015216189,0.00028997488,0.012973371,0.10322831,0.7986168],"genre_scores_gemma":[0.014440483,0.0020555435,0.023771586,0.0016681006,0.00033066372,0.00024079652,0.023847515,0.01037044,0.9232749],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995944,0.0000451764,0.00002714613,0.000106969914,0.00017849186,0.00004776168],"domain_scores_gemma":[0.99933344,0.00012507544,0.00004545143,0.00015490646,0.00013639635,0.00020466304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052682695,0.0014153267,0.0006387274,0.0015053806,0.00074825325,0.003523231,0.0016903204,0.0019795566,0.63347274],"category_scores_gemma":[0.0015290428,0.00059013,0.000531853,0.0009129586,0.00034786342,0.003376436,0.0028314455,0.0012783026,0.6265933],"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.00025358156,0.00013390914,0.0004521339,0.00046395816,0.00002215488,0.00020583032,0.0000832181,0.0012051604,0.0056581404,0.017080557,0.49185348,0.48258787],"study_design_scores_gemma":[0.000047977497,0.00004120254,0.00029405954,0.00008250097,0.000010073331,0.00019361464,0.000025495749,0.002428369,0.0017507472,0.0061796443,0.98892856,0.000017855584],"about_ca_topic_score_codex":0.0008954591,"about_ca_topic_score_gemma":0.00090226263,"teacher_disagreement_score":0.63347274,"about_ca_system_score_codex":0.000575331,"about_ca_system_score_gemma":0.00061684044,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032180117,0.00032038076,0.99427265,0.00031834806,0.00003237777,0.000054739223,0.000047581216,0.00022018795,0.0015158359],"genre_scores_gemma":[0.22798774,0.0015238263,0.7665526,0.00042592484,0.00030171472,0.00037642152,0.0004350843,0.000117897565,0.0022787508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9952833,0.0015658046,0.0003394174,0.0008685291,0.0016292036,0.0003137039],"domain_scores_gemma":[0.9912322,0.0067778802,0.0005679194,0.0007765099,0.00049659394,0.00014883504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027099808,0.0017384181,0.0015086232,0.0029496846,0.00089147285,0.0026994017,0.001789856,0.001760645,0.0033796658],"category_scores_gemma":[0.010917738,0.0007918869,0.0027772645,0.0018122697,0.004341347,0.005986995,0.0028380598,0.003802406,0.00056694215],"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.00015555181,0.00012159946,0.0010447638,0.00057459,0.000108314336,0.00033935727,0.0003023182,0.25892746,0.0048778895,0.60330135,0.0020527388,0.12819415],"study_design_scores_gemma":[0.00005711504,0.000085015825,0.00019976862,0.00008624649,0.00004323296,0.00013368785,0.000050725295,0.4927818,0.0020542834,0.500015,0.0044668945,0.000026236725],"about_ca_topic_score_codex":0.0031459793,"about_ca_topic_score_gemma":0.0018393575,"teacher_disagreement_score":0.0033796658,"about_ca_system_score_codex":0.002216937,"about_ca_system_score_gemma":0.0022741498,"threshold_uncertainty_score":0.016085088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012112813,0.000062015104,0.9838365,0.00012408504,0.000020417283,0.00006182874,0.0000694623,0.0027255754,0.0009874195],"genre_scores_gemma":[0.4077023,0.00047758705,0.5866475,0.0003551834,0.00012701431,0.00043381908,0.00056847214,0.0014558771,0.0022323565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952455,0.0012175355,0.00045876607,0.0006492981,0.0018536488,0.0005752007],"domain_scores_gemma":[0.9923741,0.004011838,0.00085077155,0.0017579197,0.000853113,0.00015219628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042115767,0.0008512756,0.0008300894,0.0011384267,0.001030405,0.00300766,0.002033758,0.0007473393,0.0019180916],"category_scores_gemma":[0.008636209,0.0011219884,0.0029288228,0.001244199,0.0034765832,0.0080943545,0.0036619043,0.002860821,0.0004295764],"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.0004369035,0.00019885687,0.004280436,0.0007393934,0.00015024653,0.00084650365,0.0019527397,0.14660895,0.04192371,0.7183599,0.004003635,0.080498755],"study_design_scores_gemma":[0.0001269621,0.00021851224,0.00069866,0.00013533501,0.00021903969,0.00032961371,0.00021052572,0.5624403,0.08069048,0.32386988,0.030960081,0.000100737554],"about_ca_topic_score_codex":0.0040049963,"about_ca_topic_score_gemma":0.0030975803,"teacher_disagreement_score":0.0042115767,"about_ca_system_score_codex":0.0017369955,"about_ca_system_score_gemma":0.002845455,"threshold_uncertainty_score":0.022273183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0294521,0.000070819646,0.9636986,0.00019909082,0.000048171623,0.00013552017,0.00017136696,0.0044446965,0.0017796283],"genre_scores_gemma":[0.48636675,0.00023349262,0.5093307,0.0001701383,0.000063733336,0.00038804242,0.00064327015,0.0006165308,0.0021872784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967243,0.0009436781,0.0002543654,0.00035337338,0.0013847841,0.0003394278],"domain_scores_gemma":[0.98545676,0.009980404,0.0010242569,0.0014802021,0.0019266253,0.00013176809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028497633,0.0006184298,0.00037897177,0.0009155409,0.00078288576,0.0014980229,0.0016775635,0.00071854936,0.0025942852],"category_scores_gemma":[0.015685514,0.00057721575,0.0011276954,0.00035176374,0.0025108685,0.0020118034,0.0012580766,0.0011075458,0.00064008083],"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.00043293432,0.00025980434,0.0042077126,0.0010609144,0.00010477657,0.0011338143,0.001461378,0.34811625,0.10076181,0.377304,0.0048484034,0.16030823],"study_design_scores_gemma":[0.00018280493,0.00018752342,0.0003798568,0.00012606295,0.00005469711,0.00022462115,0.00010333542,0.78569394,0.084056295,0.11759998,0.011336078,0.000054934026],"about_ca_topic_score_codex":0.0037545539,"about_ca_topic_score_gemma":0.003516232,"teacher_disagreement_score":0.0037545539,"about_ca_system_score_codex":0.0013903102,"about_ca_system_score_gemma":0.0034091529,"threshold_uncertainty_score":0.015071154},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014743818,0.019712523,0.42550772,0.041239683,0.001260666,0.000063387844,0.00014205213,0.00038823357,0.4969419],"genre_scores_gemma":[0.659008,0.018903555,0.22515336,0.013973322,0.004037504,0.00039041706,0.0002828076,0.00033875214,0.077912256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972801,0.00083775487,0.00011465908,0.00040738677,0.0011172142,0.00024293683],"domain_scores_gemma":[0.9983901,0.0007212104,0.00012856824,0.00026100018,0.00034790364,0.00015125208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032592476,0.0006287897,0.0007918499,0.0022972538,0.004293629,0.0086639,0.0018659257,0.0037279213,0.0034537006],"category_scores_gemma":[0.003654547,0.00046541024,0.00080083107,0.0019339011,0.021455254,0.01399536,0.0025859333,0.005139453,0.0014269917],"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.0000017787869,0.0000037281009,0.000018900495,0.000007846079,6.5106633e-7,0.000010850826,0.00031481305,0.00009034102,0.000028522323,0.9973707,0.000629805,0.0015220789],"study_design_scores_gemma":[0.0000031219683,0.0000042733336,0.00004000886,0.000020741028,0.0000014139788,0.00002315977,0.00008538513,0.0003097369,0.000036205503,0.97127354,0.028198896,0.000003397521],"about_ca_topic_score_codex":0.0031747662,"about_ca_topic_score_gemma":0.0024045156,"teacher_disagreement_score":0.0086639,"about_ca_system_score_codex":0.0039572,"about_ca_system_score_gemma":0.0027352455,"threshold_uncertainty_score":0.028711617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007757283,0.00013103617,0.9741582,0.00032811696,0.00021619113,0.00010599889,0.00007624561,0.014065559,0.0031612366],"genre_scores_gemma":[0.15145962,0.00040277076,0.8297723,0.0009260508,0.00029514573,0.00033251144,0.00046495534,0.010187818,0.0061589116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950659,0.0009177621,0.0006831904,0.0006990377,0.002182211,0.00045193438],"domain_scores_gemma":[0.9921256,0.0028043773,0.000611287,0.0030197075,0.001044781,0.00039420556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050665853,0.00086518837,0.0008655726,0.0012489728,0.00086344325,0.003235122,0.003563699,0.001540955,0.0028263316],"category_scores_gemma":[0.015371518,0.001961839,0.0018089198,0.0009387463,0.002789978,0.00867223,0.0050414326,0.004999399,0.0010206505],"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.00095724803,0.00035688377,0.0064697796,0.0012780962,0.0002641095,0.0014235462,0.003933661,0.019925136,0.049697313,0.55577576,0.017676236,0.3422423],"study_design_scores_gemma":[0.00029371917,0.0004118771,0.0012072929,0.0002480969,0.0003428305,0.001511239,0.0002773092,0.16639332,0.07901585,0.3550007,0.3949922,0.000305596],"about_ca_topic_score_codex":0.002156649,"about_ca_topic_score_gemma":0.0023520119,"teacher_disagreement_score":0.0050665853,"about_ca_system_score_codex":0.00083949545,"about_ca_system_score_gemma":0.0021146617,"threshold_uncertainty_score":0.02679503},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002280201,0.002832597,0.009362693,0.004169692,0.0046697105,0.0002828576,0.007955715,0.01117307,0.9572734],"genre_scores_gemma":[0.016935881,0.002908926,0.006794287,0.0023586494,0.00092545204,0.00022828755,0.012325965,0.0031099408,0.9544127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852234,0.0002214754,0.000106897285,0.00031549833,0.00065445073,0.00017931162],"domain_scores_gemma":[0.99754745,0.0003322783,0.00014174584,0.00051430124,0.0007632219,0.00070098153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012786564,0.0012956415,0.0008769258,0.0022476066,0.0019419093,0.0062121274,0.001869382,0.0029003518,0.78853047],"category_scores_gemma":[0.0044962107,0.0006026211,0.0007789013,0.0016384982,0.00073501293,0.0035723299,0.0044483836,0.0019322314,0.6731051],"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.00042413152,0.00016632132,0.0010727136,0.0007949449,0.000029332554,0.00047765765,0.00027997795,0.00047821717,0.003188581,0.021407133,0.6190179,0.3526631],"study_design_scores_gemma":[0.000021858064,0.000028816321,0.00030298406,0.00009487804,0.000005317404,0.00024749365,0.000059558322,0.00021935633,0.0004607238,0.003002837,0.9955461,0.000009997936],"about_ca_topic_score_codex":0.0017768837,"about_ca_topic_score_gemma":0.002298615,"teacher_disagreement_score":0.21146953,"about_ca_system_score_codex":0.0011403207,"about_ca_system_score_gemma":0.002344235,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09444012,0.0022304554,0.60392666,0.00055351754,0.00049827265,0.0011448883,0.019390583,0.22836591,0.049449604],"genre_scores_gemma":[0.4800412,0.0006179677,0.47738063,0.0005056355,0.0002100562,0.0010778124,0.01332548,0.009373288,0.017467873],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735755,0.00035831268,0.00014281076,0.00052715937,0.0013945115,0.00021968965],"domain_scores_gemma":[0.99001884,0.0022895527,0.0010391759,0.0032449374,0.0032419928,0.00016551667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017607464,0.0014338872,0.0009886614,0.003411018,0.00055705354,0.0012697943,0.003097966,0.000972511,0.017250827],"category_scores_gemma":[0.012056363,0.0006058586,0.0006054305,0.0026651947,0.00033378374,0.0014703815,0.0010805498,0.00087151467,0.007987258],"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.0013754511,0.0003382438,0.009378827,0.0008949736,0.00018486797,0.0004338475,0.00024727572,0.0939689,0.045030583,0.013989793,0.12248103,0.71167624],"study_design_scores_gemma":[0.00022657559,0.00046987121,0.009539134,0.000107344335,0.00007414805,0.0009841468,0.00007752706,0.7617584,0.10422786,0.007527249,0.11467946,0.00032837372],"about_ca_topic_score_codex":0.0063650575,"about_ca_topic_score_gemma":0.0065877154,"teacher_disagreement_score":0.017250827,"about_ca_system_score_codex":0.0012301848,"about_ca_system_score_gemma":0.0015253469,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615411,0.00023209685,0.033735413,0.00020003383,0.000012840697,0.00008604118,0.000035934885,0.00028953704,0.0038669086],"genre_scores_gemma":[0.9920169,0.000051201332,0.0075095934,0.000033928653,0.000006170616,0.0000258073,0.000032719196,0.00008606946,0.00023759055],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9834719,0.007023061,0.0010618374,0.0015278048,0.0053586005,0.0015568114],"domain_scores_gemma":[0.73039687,0.21202725,0.022279454,0.020701936,0.011473732,0.0031206599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014978382,0.0007340162,0.0003700222,0.0018886934,0.000976958,0.002231232,0.0011529289,0.00072717154,0.0021912593],"category_scores_gemma":[0.123060055,0.00053814845,0.0005625391,0.0010271017,0.0024202908,0.0043740286,0.0028476152,0.001382538,0.00019318535],"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.00164189,0.0013098087,0.4003324,0.0014139863,0.00049414573,0.0021065413,0.011058997,0.1328238,0.11751828,0.030554162,0.0008023064,0.29994377],"study_design_scores_gemma":[0.00020825886,0.0066320724,0.4499261,0.00048989797,0.0010242359,0.0038448905,0.010694761,0.2990703,0.17178254,0.044872195,0.01102094,0.00043379466],"about_ca_topic_score_codex":0.0017347133,"about_ca_topic_score_gemma":0.0021979222,"teacher_disagreement_score":0.014978382,"about_ca_system_score_codex":0.0010975328,"about_ca_system_score_gemma":0.0012555096,"threshold_uncertainty_score":0.079214215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009781737,0.0002299184,0.9226242,0.00012301987,0.00019650198,0.00046114047,0.00026686015,0.057562247,0.008754452],"genre_scores_gemma":[0.42445737,0.00044057443,0.5210247,0.0009904184,0.00028600032,0.0012217689,0.0019725214,0.014040802,0.03556583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975107,0.00045824936,0.00020385419,0.0004136692,0.0011270664,0.00028654025],"domain_scores_gemma":[0.99421114,0.0015706635,0.0003760255,0.0028153933,0.000819011,0.00020777571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680857,0.0011632345,0.00068656227,0.0010976483,0.00041680032,0.0023151524,0.0031574548,0.0013198592,0.016496738],"category_scores_gemma":[0.011755918,0.0013034603,0.001041784,0.0004244711,0.0010136319,0.0046709673,0.0038715163,0.0028493311,0.006872006],"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.0015060906,0.0007454594,0.0076763933,0.0016273095,0.00022463765,0.0016798401,0.0013309271,0.029755024,0.1288184,0.22749078,0.037310626,0.5618345],"study_design_scores_gemma":[0.00042778134,0.00066422526,0.003474143,0.00034446773,0.00017473205,0.0027905996,0.000097503165,0.25898522,0.30981755,0.07971164,0.34328765,0.00022446718],"about_ca_topic_score_codex":0.0004311654,"about_ca_topic_score_gemma":0.00032822735,"teacher_disagreement_score":0.016496738,"about_ca_system_score_codex":0.0005563725,"about_ca_system_score_gemma":0.001346084,"threshold_uncertainty_score":0.055187106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59514713,0.0006156454,0.38627312,0.0014215839,0.00010713882,0.0006049414,0.0021741514,0.004565384,0.009090808],"genre_scores_gemma":[0.8659952,0.00015354104,0.12927623,0.0001384952,0.00003951007,0.00017867963,0.0020526752,0.00034524835,0.0018203834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.992652,0.0022996608,0.00036513474,0.0008844111,0.0033245913,0.0004741547],"domain_scores_gemma":[0.9202562,0.06312679,0.0029101712,0.0058225766,0.0073274556,0.00055677834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059188385,0.0008404732,0.00062872743,0.0020382844,0.00060441985,0.0018881471,0.0013652191,0.0008413342,0.0036006165],"category_scores_gemma":[0.086629204,0.0008190723,0.00079799467,0.0018155565,0.0006293437,0.0027151145,0.0012054611,0.0014609192,0.0004948777],"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.002558933,0.00050471607,0.19166587,0.00087638607,0.0004931901,0.0013737194,0.0021737607,0.40349036,0.019894809,0.034912102,0.013316129,0.32874006],"study_design_scores_gemma":[0.000065686465,0.000099962264,0.011673769,0.000032581065,0.000067492874,0.00008427595,0.00020279526,0.9727692,0.0036207854,0.00892878,0.002430666,0.000024148641],"about_ca_topic_score_codex":0.012323993,"about_ca_topic_score_gemma":0.017911397,"teacher_disagreement_score":0.012323993,"about_ca_system_score_codex":0.0013660294,"about_ca_system_score_gemma":0.001821659,"threshold_uncertainty_score":0.031302214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01686894,0.00003379887,0.973631,0.000112838396,0.000015186765,0.00014149962,0.000050803726,0.008177312,0.00096859265],"genre_scores_gemma":[0.27905133,0.000091322945,0.71565527,0.0001601023,0.000030590607,0.00030822272,0.00020488509,0.0028759576,0.0016222667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964993,0.0010878309,0.00031201105,0.000553243,0.0013589407,0.00018861798],"domain_scores_gemma":[0.98571175,0.006550375,0.0011403009,0.005690516,0.00071065105,0.00019639928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041027498,0.0007637926,0.0003880304,0.0007057909,0.0004935429,0.0015933379,0.0017723655,0.0010373351,0.0021154084],"category_scores_gemma":[0.016922923,0.0010073924,0.0014167286,0.00038026297,0.0018209578,0.003674836,0.0025352668,0.0022532512,0.00040927806],"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.0011985074,0.0004585141,0.01758347,0.00097020145,0.00019852458,0.0020513062,0.004036046,0.12837288,0.23410065,0.27730647,0.00659372,0.3271297],"study_design_scores_gemma":[0.00009656257,0.00033847033,0.0023569153,0.00020884206,0.00016246809,0.001024454,0.00015742233,0.7042062,0.1792067,0.08254737,0.029567117,0.00012745481],"about_ca_topic_score_codex":0.0006942158,"about_ca_topic_score_gemma":0.0014008424,"teacher_disagreement_score":0.0041027498,"about_ca_system_score_codex":0.0007259028,"about_ca_system_score_gemma":0.0011741298,"threshold_uncertainty_score":0.0216977},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016389588,0.02382667,0.4444654,0.4848139,0.010910337,0.00025005342,0.0005909157,0.0039846664,0.01476842],"genre_scores_gemma":[0.4529923,0.018872138,0.2986853,0.19086464,0.017575324,0.0012621402,0.00056065404,0.005035585,0.01415186],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94286215,0.037273455,0.002564451,0.0052932706,0.010446085,0.0015606164],"domain_scores_gemma":[0.6094076,0.31157607,0.015273821,0.02530336,0.034534656,0.003904402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08138745,0.0010934086,0.0025137987,0.0018779017,0.0020311775,0.005797877,0.0038241167,0.0070433766,0.010580747],"category_scores_gemma":[0.40423614,0.0010240489,0.0016314448,0.0029485365,0.011317334,0.017405886,0.0031408677,0.01732052,0.005003414],"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.0009916293,0.0006122576,0.036489256,0.0018276292,0.00079980725,0.00068819296,0.0046815644,0.012525225,0.0022524998,0.22667825,0.28632873,0.426125],"study_design_scores_gemma":[0.0004945636,0.0007171148,0.015135213,0.002151211,0.00031034107,0.00078679284,0.003527153,0.03146052,0.004994151,0.728121,0.21181996,0.00048195547],"about_ca_topic_score_codex":0.0057484936,"about_ca_topic_score_gemma":0.0029573615,"teacher_disagreement_score":0.08138745,"about_ca_system_score_codex":0.002176368,"about_ca_system_score_gemma":0.0033406294,"threshold_uncertainty_score":0.43042314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08081318,0.003521326,0.68938106,0.0029385295,0.0029693327,0.001936285,0.0033718643,0.065558165,0.14951016],"genre_scores_gemma":[0.7034687,0.0021320004,0.18751027,0.001380085,0.0011997815,0.0011516211,0.008248107,0.0038611763,0.091048315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976936,0.00025882787,0.0001850211,0.0005862576,0.0007769611,0.00049924414],"domain_scores_gemma":[0.99584717,0.00041830033,0.00025938498,0.0011818866,0.0018751355,0.00041816075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411958,0.0015383016,0.0011681959,0.0027905204,0.0033392694,0.0054195435,0.0042336634,0.0013387225,0.017560923],"category_scores_gemma":[0.0060973424,0.00053125696,0.00079217635,0.0022597257,0.0007049778,0.0039757504,0.0028648844,0.001535741,0.008692427],"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.00072705874,0.0005921838,0.006564836,0.0003297615,0.00012622541,0.00034807378,0.0005407436,0.055067454,0.02960156,0.056056775,0.11920817,0.7308371],"study_design_scores_gemma":[0.00011737099,0.00039574405,0.003609361,0.000125307,0.00016475173,0.0005098534,0.0005649761,0.57768595,0.04410289,0.05918491,0.31333414,0.00020475234],"about_ca_topic_score_codex":0.006654527,"about_ca_topic_score_gemma":0.005470211,"teacher_disagreement_score":0.017560923,"about_ca_system_score_codex":0.0029148269,"about_ca_system_score_gemma":0.0032021652,"threshold_uncertainty_score":0.058747172},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06538603,0.0015716245,0.8656142,0.0010555681,0.00029973534,0.00037291335,0.00033131876,0.05839985,0.00696877],"genre_scores_gemma":[0.20724134,0.0007905479,0.7782799,0.00045900443,0.00010897238,0.0002910387,0.0009727634,0.0064272135,0.0054292437],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99253744,0.0027521763,0.00063735706,0.0008844085,0.0027493797,0.00043918184],"domain_scores_gemma":[0.95126504,0.017086627,0.004108234,0.021080457,0.005894777,0.0005648571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071594156,0.0011654638,0.00080239243,0.0022937332,0.0014939422,0.0023196982,0.0038007386,0.0027405522,0.005759165],"category_scores_gemma":[0.046775308,0.0011440978,0.001278156,0.0021312789,0.0012697636,0.0058333594,0.004998804,0.002850133,0.0031746875],"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.00042182003,0.0004679915,0.014351348,0.0013113735,0.00012546414,0.0013661913,0.0035018784,0.01840528,0.06596809,0.030353446,0.025325894,0.8384012],"study_design_scores_gemma":[0.00037077584,0.0007210265,0.010143742,0.0012880855,0.00047986035,0.0034488845,0.0011770029,0.22441438,0.25601393,0.056234013,0.44518045,0.0005279322],"about_ca_topic_score_codex":0.0023073787,"about_ca_topic_score_gemma":0.0038980632,"teacher_disagreement_score":0.0071594156,"about_ca_system_score_codex":0.0008876819,"about_ca_system_score_gemma":0.0031953508,"threshold_uncertainty_score":0.037863016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1764302,0.00015636788,0.8165242,0.000097293465,0.000018876457,0.00007436337,0.00004529259,0.005629024,0.001024365],"genre_scores_gemma":[0.7895097,0.00012151183,0.20892046,0.00003773383,0.000013209766,0.00004389156,0.000053986303,0.00018867996,0.0011107738],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990282,0.0003013712,0.000053738626,0.00015532327,0.00039105696,0.00007028135],"domain_scores_gemma":[0.9960905,0.001586806,0.0007916982,0.0009605429,0.0004828232,0.000087639644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005580995,0.00058656407,0.0003629456,0.0013082131,0.0002152111,0.00045537294,0.00065955933,0.00040295726,0.00074960216],"category_scores_gemma":[0.003719151,0.00023541757,0.00019617927,0.00044577708,0.00046785802,0.0009270387,0.0005513626,0.000506768,0.0002762448],"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.00056129665,0.00035166304,0.015159266,0.0002381871,0.000066526736,0.0010100319,0.00083440356,0.055598214,0.29966646,0.005409932,0.0012879268,0.61981606],"study_design_scores_gemma":[0.000025947667,0.00033201836,0.0062195645,0.000031153417,0.000029835948,0.0007232981,0.00010384542,0.7832,0.20363623,0.0038820063,0.0017907419,0.000025340574],"about_ca_topic_score_codex":0.00044843103,"about_ca_topic_score_gemma":0.001001239,"teacher_disagreement_score":0.0013082131,"about_ca_system_score_codex":0.00022416786,"about_ca_system_score_gemma":0.0004312153,"threshold_uncertainty_score":0.0029515028},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008551534,0.0012611161,0.7669455,0.0016840125,0.0017073447,0.0003754815,0.008596904,0.070831195,0.14004698],"genre_scores_gemma":[0.10253914,0.002295837,0.65898055,0.003320404,0.00045482704,0.00069935713,0.03448668,0.022244949,0.17497838],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982936,0.0002147479,0.00017283032,0.00036044416,0.0008018606,0.00015659026],"domain_scores_gemma":[0.9982444,0.00036834367,0.00009372629,0.0006035002,0.0005898677,0.00010016476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012389154,0.00061494095,0.0005512925,0.0012806169,0.0007446901,0.0028480592,0.0015037411,0.00075013016,0.047859218],"category_scores_gemma":[0.0038847418,0.000507737,0.0009355351,0.00090290676,0.0006366209,0.0029077039,0.003078241,0.0013659813,0.02452395],"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.00039402224,0.00014127787,0.003067902,0.0010959288,0.000050964278,0.0004950146,0.0005075802,0.0047616446,0.012358055,0.17193496,0.20318887,0.6020038],"study_design_scores_gemma":[0.00003192487,0.00003344249,0.00036383988,0.000067327754,0.000017072547,0.00035545393,0.000058807476,0.0070638293,0.0073908907,0.017110191,0.96748227,0.000024879502],"about_ca_topic_score_codex":0.0013207971,"about_ca_topic_score_gemma":0.001870554,"teacher_disagreement_score":0.047859218,"about_ca_system_score_codex":0.0007839332,"about_ca_system_score_gemma":0.0016760197,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013001448,0.00034935618,0.9611788,0.0006202578,0.0002929332,0.00018003992,0.0007354938,0.004125325,0.019516326],"genre_scores_gemma":[0.37074018,0.001005528,0.56939244,0.0020375794,0.0005541684,0.0014981717,0.002832215,0.006448392,0.045491327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930807,0.0011148305,0.0010023054,0.0022291187,0.0018131933,0.000759891],"domain_scores_gemma":[0.9894489,0.0034053263,0.00076976116,0.004174466,0.0018803416,0.0003211628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005391953,0.00094773865,0.0012767774,0.0018477795,0.002562216,0.0048812996,0.003464887,0.0018190234,0.011619674],"category_scores_gemma":[0.012414486,0.0014352683,0.0028023073,0.002162498,0.006126549,0.015724463,0.00839381,0.0042072353,0.0033387614],"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.000079763544,0.000029026634,0.001157915,0.00014287587,0.000028591092,0.00019056792,0.0010258476,0.0007638968,0.0021334,0.9569611,0.004156426,0.033330776],"study_design_scores_gemma":[0.000032828808,0.00007627666,0.00044888357,0.00019091557,0.00008857492,0.00074857357,0.00039758033,0.0123355435,0.01783399,0.7611064,0.20665376,0.000086673805],"about_ca_topic_score_codex":0.0024336353,"about_ca_topic_score_gemma":0.0017339265,"teacher_disagreement_score":0.011619674,"about_ca_system_score_codex":0.0019885104,"about_ca_system_score_gemma":0.0024696272,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07323036,0.0014364134,0.8935884,0.00050106953,0.00021658676,0.0003389588,0.00021636377,0.025897697,0.004574092],"genre_scores_gemma":[0.72647077,0.00044525514,0.26733553,0.00028573492,0.00014741204,0.00029208552,0.0005010788,0.001372797,0.0031493325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9876841,0.0038958015,0.0007648183,0.0015972777,0.0049259383,0.0011320995],"domain_scores_gemma":[0.9484598,0.026346842,0.0038794368,0.015793398,0.004142486,0.0013780654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052618654,0.0018573304,0.0016219522,0.0029487931,0.0010938747,0.0022322787,0.00420423,0.0012589451,0.0049783164],"category_scores_gemma":[0.035524495,0.0010998459,0.0007312169,0.0025337504,0.0012552787,0.0042594965,0.003154126,0.0021933487,0.0014480236],"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.0050198953,0.00067709474,0.01688802,0.00052668556,0.00021736248,0.0004032122,0.0010962582,0.081715524,0.08920475,0.017044542,0.009315426,0.7778912],"study_design_scores_gemma":[0.00023348635,0.000546329,0.0039616404,0.000089935325,0.00016809504,0.00037542448,0.00017359626,0.9264068,0.04806256,0.014029217,0.005876019,0.00007688813],"about_ca_topic_score_codex":0.006731815,"about_ca_topic_score_gemma":0.0067335693,"teacher_disagreement_score":0.006731815,"about_ca_system_score_codex":0.0016446915,"about_ca_system_score_gemma":0.0034676243,"threshold_uncertainty_score":0.02782774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020067828,0.00014424136,0.94852185,0.00009114261,0.00008405664,0.0001432371,0.00022129845,0.025001017,0.005725383],"genre_scores_gemma":[0.21209843,0.0002629311,0.76725143,0.00021931896,0.0000867484,0.00032064662,0.0012789485,0.010492199,0.00798926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990982,0.00021087923,0.00006790332,0.00016525744,0.00033791232,0.000119904675],"domain_scores_gemma":[0.9983109,0.00046483133,0.00014150869,0.0007855228,0.00022794055,0.00006933626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032539,0.00074696273,0.00047134756,0.00087312685,0.00043978862,0.0010784633,0.0011828392,0.00044961876,0.004787148],"category_scores_gemma":[0.0029763114,0.00068541424,0.001154825,0.00083999045,0.000757959,0.0018003399,0.0018904813,0.0011043851,0.0022491599],"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.00060443336,0.00039474308,0.004616777,0.00062695926,0.00017539333,0.0005169088,0.0009324292,0.102094516,0.14181836,0.09375465,0.032420337,0.62204444],"study_design_scores_gemma":[0.00024220943,0.00048889825,0.0023418185,0.00011099186,0.00014317052,0.0008708158,0.00017940866,0.60951674,0.18133031,0.09724684,0.10741073,0.00011815179],"about_ca_topic_score_codex":0.0008230417,"about_ca_topic_score_gemma":0.001549023,"teacher_disagreement_score":0.004787148,"about_ca_system_score_codex":0.00043271974,"about_ca_system_score_gemma":0.0013266684,"threshold_uncertainty_score":0.016014576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16998467,0.0005419726,0.82305396,0.00025320912,0.000036288366,0.00008838579,0.00044117958,0.0038212186,0.0017791013],"genre_scores_gemma":[0.84180707,0.00037282708,0.15603073,0.00006878849,0.0000473144,0.00013519994,0.0006386427,0.00022511082,0.0006743401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881613,0.0003098187,0.0000742349,0.00022349673,0.0004903673,0.000086065134],"domain_scores_gemma":[0.9912191,0.004456962,0.0017436339,0.0013192866,0.0010509292,0.00021006209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012362024,0.0008843493,0.00061578903,0.0019038535,0.0004345075,0.00069507083,0.0006110776,0.00041646752,0.0007998903],"category_scores_gemma":[0.010076551,0.00052547036,0.00035816373,0.0018794091,0.00049460866,0.0018356293,0.00059047376,0.0011628346,0.00038113818],"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.00048157354,0.00035251866,0.09784522,0.00028468523,0.00012700248,0.0002968284,0.00033872982,0.4573643,0.035880823,0.016081328,0.0031939964,0.387753],"study_design_scores_gemma":[0.0000073784936,0.000120388824,0.004678649,0.000016877595,0.000025561882,0.00007600086,0.000024622812,0.9752343,0.010768059,0.00773607,0.0012891893,0.000022832486],"about_ca_topic_score_codex":0.0020854075,"about_ca_topic_score_gemma":0.0053421687,"teacher_disagreement_score":0.0020854075,"about_ca_system_score_codex":0.00055819657,"about_ca_system_score_gemma":0.0014458343,"threshold_uncertainty_score":0.0065377355},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037112315,0.00086602685,0.035748858,0.003246396,0.0036549557,0.00032862023,0.0034638168,0.008431038,0.940549],"genre_scores_gemma":[0.009431582,0.0007565318,0.010614544,0.0010337118,0.00046361954,0.00016047325,0.004361719,0.0015736771,0.97160405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933463,0.00011116891,0.00004398743,0.00013955132,0.00028589624,0.00008478879],"domain_scores_gemma":[0.9991184,0.00016138218,0.00006331213,0.0001579922,0.00037309565,0.00012573565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567425,0.00077917415,0.00032006748,0.0007861108,0.0011487406,0.0032520876,0.0012062162,0.0011778151,0.49461108],"category_scores_gemma":[0.0020806943,0.0003307122,0.00043827365,0.0008925254,0.0006989281,0.0030739168,0.0019893583,0.0011640259,0.2551121],"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.00014814366,0.0000662132,0.0008993577,0.00030507467,0.000007933632,0.00026000323,0.0004709049,0.00044945674,0.003136713,0.11321358,0.66381085,0.21723187],"study_design_scores_gemma":[0.0000057943084,0.00002359383,0.0001994341,0.000032189237,0.000001455787,0.00010698083,0.000058237125,0.00022946142,0.0004199606,0.0025412152,0.9963755,0.000006123834],"about_ca_topic_score_codex":0.0027666958,"about_ca_topic_score_gemma":0.0025849654,"teacher_disagreement_score":0.49461108,"about_ca_system_score_codex":0.00096508075,"about_ca_system_score_gemma":0.0012944882,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045033146,0.0005644041,0.9478951,0.00016554505,0.000034228284,0.00012855459,0.00012537463,0.004442974,0.0016105893],"genre_scores_gemma":[0.7872979,0.00027879697,0.21106288,0.00010728908,0.00004436222,0.0001431705,0.0002445525,0.00018363813,0.0006373181],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959848,0.0013236009,0.00021118883,0.0007663238,0.0013458699,0.00036824224],"domain_scores_gemma":[0.98779416,0.006093634,0.0017948487,0.0024258583,0.0015473256,0.00034421677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027349086,0.00072445115,0.00087957823,0.0016331854,0.0006472943,0.0011185826,0.001784085,0.00064060534,0.001047022],"category_scores_gemma":[0.011959959,0.00050777424,0.0005092827,0.0012356509,0.00094244437,0.0019208969,0.0011496082,0.0010484398,0.00029355416],"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.0017590299,0.0005022104,0.027897991,0.00063286826,0.00017891287,0.00031622566,0.0006769687,0.41017595,0.08160197,0.02769788,0.005151919,0.44340804],"study_design_scores_gemma":[0.00003218444,0.00020876444,0.0018567521,0.000026661466,0.000039498806,0.0001592552,0.000044375196,0.96681565,0.023106905,0.005707809,0.001975402,0.000026731634],"about_ca_topic_score_codex":0.0027581025,"about_ca_topic_score_gemma":0.0033482697,"teacher_disagreement_score":0.0027581025,"about_ca_system_score_codex":0.0013837124,"about_ca_system_score_gemma":0.002034183,"threshold_uncertainty_score":0.014463782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0354205,0.00071286067,0.5727072,0.00062776776,0.00043936798,0.00035934322,0.009575757,0.33662394,0.04353335],"genre_scores_gemma":[0.23640779,0.00059991947,0.6166499,0.0015468734,0.00013590336,0.0007119187,0.039616875,0.045960393,0.058370475],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878293,0.00019900216,0.00012138058,0.0003083414,0.0004790133,0.00010936818],"domain_scores_gemma":[0.9971847,0.0007112329,0.00021227224,0.0011973183,0.0006271534,0.000067254325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104877,0.00092822115,0.00053041853,0.0008490494,0.00035426187,0.0011873591,0.0016984481,0.0007012492,0.020477543],"category_scores_gemma":[0.00464315,0.0009985099,0.00097016036,0.00049704715,0.00051782595,0.0026905406,0.001966086,0.0014360489,0.013756786],"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.0019208579,0.0004660737,0.0113338325,0.0013771497,0.00027169264,0.0006519591,0.00056395086,0.021702264,0.04199682,0.051537532,0.35407683,0.514101],"study_design_scores_gemma":[0.00039752084,0.0005631821,0.003328734,0.00018333827,0.00015249092,0.0013484017,0.00008958051,0.17743874,0.15597649,0.028894639,0.6315184,0.00010845085],"about_ca_topic_score_codex":0.00069925253,"about_ca_topic_score_gemma":0.0012353967,"teacher_disagreement_score":0.020477543,"about_ca_system_score_codex":0.00041380024,"about_ca_system_score_gemma":0.0011776591,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035826836,0.00031009523,0.9457643,0.00016576704,0.00010474146,0.00019718148,0.00025207511,0.013957174,0.0034217802],"genre_scores_gemma":[0.42042154,0.000112605674,0.5741423,0.00017262244,0.000038790797,0.0002867753,0.0005075591,0.0021511605,0.0021666505],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9948931,0.0014057185,0.0004969561,0.001053921,0.0016633887,0.00048693368],"domain_scores_gemma":[0.98965424,0.0037136527,0.0009292654,0.0042150966,0.0011543897,0.00033330885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034522521,0.00114013,0.00092662574,0.0023930056,0.0007454317,0.0017904993,0.0023667847,0.00091338315,0.004392032],"category_scores_gemma":[0.010810466,0.00072459993,0.0005883513,0.001644358,0.0016896084,0.004685779,0.0041061332,0.0020705813,0.0011943358],"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.003489928,0.0006096875,0.014756872,0.00074203516,0.00014182465,0.00068797776,0.0016907362,0.029619306,0.14904189,0.07498483,0.009890091,0.7143448],"study_design_scores_gemma":[0.00035984544,0.0011518997,0.006088391,0.00024382726,0.00015117678,0.0011348071,0.00040708532,0.5371127,0.28495562,0.10187128,0.06626252,0.0002609394],"about_ca_topic_score_codex":0.0014101644,"about_ca_topic_score_gemma":0.002000622,"teacher_disagreement_score":0.004392032,"about_ca_system_score_codex":0.0010026385,"about_ca_system_score_gemma":0.0014532005,"threshold_uncertainty_score":0.018257499},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024925575,0.0023547742,0.33664733,0.0024037017,0.0023568256,0.0006341798,0.0119006885,0.17479712,0.44397983],"genre_scores_gemma":[0.23989153,0.001956025,0.34920204,0.0034556214,0.00042790934,0.0008664367,0.03969775,0.02105577,0.34344697],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00008490438,0.000039339233,0.0001553215,0.0003047164,0.000095899915],"domain_scores_gemma":[0.99905974,0.00009756911,0.000046051788,0.00034271448,0.00036482167,0.000089135814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280058,0.0009735219,0.0006328877,0.0006936478,0.00069483375,0.0021507526,0.0024075932,0.0012650755,0.09432103],"category_scores_gemma":[0.001791605,0.0006196718,0.0006497224,0.00089849054,0.0004427953,0.0017197651,0.0021461197,0.0017901124,0.044936165],"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.0007860796,0.00015866158,0.0037937232,0.00050797005,0.00010474287,0.00040435212,0.00024126,0.012704792,0.02348613,0.09219724,0.54811805,0.31749696],"study_design_scores_gemma":[0.0001374237,0.0001444478,0.00093910965,0.00005394358,0.000024982455,0.0004017796,0.00003892828,0.05413234,0.01753532,0.01036743,0.9161721,0.000052209467],"about_ca_topic_score_codex":0.0034189618,"about_ca_topic_score_gemma":0.005516037,"teacher_disagreement_score":0.09432103,"about_ca_system_score_codex":0.0012396561,"about_ca_system_score_gemma":0.0013704429,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831548,0.00015315639,0.009894477,0.00013201761,0.00010456218,0.004561371,0.0005280465,0.00037026222,0.001101388],"genre_scores_gemma":[0.9272426,0.00024650226,0.050241187,0.00073396077,0.0001720822,0.015657958,0.0010162828,0.00020017952,0.004489172],"study_design_codex":"bench_or_experimental","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.9958015,0.0020322185,0.00035252344,0.00097550434,0.00046862155,0.0003695612],"domain_scores_gemma":[0.92692024,0.06262294,0.003021704,0.0033694918,0.002299109,0.0017665165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007172884,0.0018308312,0.0010435983,0.000654164,0.0009473758,0.0012200599,0.002138994,0.002271961,0.009178252],"category_scores_gemma":[0.02321655,0.0009898461,0.0007416409,0.00041333423,0.0014031302,0.0019678795,0.0014676682,0.0016591462,0.0014500824],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.10167422,0.2906597,0.035138182,0.008502848,0.0008476301,0.0028437767,0.033471543,0.011738352,0.31095546,0.0030231397,0.010698731,0.19044638],"study_design_scores_gemma":[0.06696827,0.5799923,0.09508623,0.00078580965,0.0019852652,0.0018414983,0.010140975,0.050151687,0.15072566,0.010626125,0.030895548,0.00080062466],"about_ca_topic_score_codex":0.00063713663,"about_ca_topic_score_gemma":0.0008277664,"teacher_disagreement_score":0.009178252,"about_ca_system_score_codex":0.00037236177,"about_ca_system_score_gemma":0.00087239296,"threshold_uncertainty_score":0.037934303},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019381315,0.0057288334,0.01771507,0.011688385,0.02481852,0.0011501545,0.034950517,0.008931617,0.8930788],"genre_scores_gemma":[0.0107956305,0.0023889625,0.003648087,0.001231318,0.0036138007,0.0003025641,0.009003387,0.0027145555,0.9663018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940586,0.00009665597,0.000022967986,0.00015849316,0.00018143747,0.00013461125],"domain_scores_gemma":[0.99894184,0.00020229658,0.000027550837,0.0002220461,0.00018648061,0.00041981196],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010744419,0.0017980438,0.002516597,0.0006819402,0.0014694962,0.0044900365,0.0016887793,0.0022953802,0.88300353],"category_scores_gemma":[0.0021242858,0.00043196653,0.0016184733,0.0015566095,0.00034719484,0.0016661128,0.0020874625,0.00246596,0.7286033],"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.00020274894,0.00011910643,0.00005199347,0.0001766498,0.00002153675,0.000015861982,0.0000069801936,0.00047003682,0.0008885852,0.0016699939,0.957838,0.0385386],"study_design_scores_gemma":[0.00016690504,0.00015217166,0.0006374618,0.00007530256,0.000031855816,0.000037006535,0.00002404277,0.0020795155,0.0010513838,0.0030394045,0.992683,0.000022054684],"about_ca_topic_score_codex":0.0018165524,"about_ca_topic_score_gemma":0.0037934913,"teacher_disagreement_score":0.88300353,"about_ca_system_score_codex":0.0012189745,"about_ca_system_score_gemma":0.0018095511,"threshold_uncertainty_score":0.16688126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056705974,0.005676885,0.6355458,0.004594336,0.002047336,0.00035461635,0.0015224235,0.056898575,0.23665404],"genre_scores_gemma":[0.45395696,0.0032865417,0.26529866,0.004369297,0.00048886484,0.0004042849,0.0028599428,0.009535193,0.25980026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867165,0.00013072047,0.000060381117,0.00029139052,0.0006253881,0.0002205631],"domain_scores_gemma":[0.99819034,0.00049026014,0.00012281157,0.0006774526,0.0004373095,0.00008181631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071962073,0.0010042207,0.0005251632,0.0008737464,0.0010343682,0.0020437527,0.0023813897,0.0013561718,0.03403904],"category_scores_gemma":[0.00406481,0.0004814512,0.00067144673,0.0008742761,0.0008964037,0.0036630717,0.0021171505,0.0018733792,0.01386666],"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.0005928724,0.00017756225,0.0017837582,0.0008869726,0.000070568116,0.00059168454,0.0004261453,0.025256675,0.050937153,0.07409997,0.1436649,0.7015117],"study_design_scores_gemma":[0.00013063278,0.00037921203,0.0017347102,0.00020034092,0.000118898824,0.0020243146,0.00017468199,0.10386632,0.120698854,0.058395498,0.7121054,0.00017113825],"about_ca_topic_score_codex":0.0019159266,"about_ca_topic_score_gemma":0.00348122,"teacher_disagreement_score":0.03403904,"about_ca_system_score_codex":0.001133799,"about_ca_system_score_gemma":0.0013876397,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038090654,0.0032515477,0.57372195,0.0028857985,0.0014005447,0.00066526904,0.0046297517,0.10426727,0.27108726],"genre_scores_gemma":[0.24915387,0.0030020936,0.58101374,0.0024203744,0.0004434751,0.00089662464,0.019118676,0.013807742,0.13014343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876785,0.00015737535,0.00007207477,0.00030910957,0.00057819486,0.00011550052],"domain_scores_gemma":[0.9976417,0.0005256306,0.00015716553,0.00090299617,0.0006228728,0.00014965978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093572144,0.0009993869,0.0005825887,0.0009537189,0.00057034317,0.0019200068,0.002516045,0.00065474526,0.04646147],"category_scores_gemma":[0.0031337137,0.0005526751,0.00065057096,0.0011373834,0.00079763087,0.00362646,0.0020840862,0.001856245,0.014649414],"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.0012324947,0.00043776626,0.0025645846,0.0009559615,0.00009215526,0.0002138018,0.0002038491,0.02679134,0.037159324,0.094680324,0.21173444,0.6239339],"study_design_scores_gemma":[0.0003240669,0.0007689856,0.0020708418,0.00017793446,0.00009029208,0.0006155518,0.00010327346,0.21850055,0.07744169,0.043686114,0.65610385,0.00011685387],"about_ca_topic_score_codex":0.0020684297,"about_ca_topic_score_gemma":0.004190402,"teacher_disagreement_score":0.04646147,"about_ca_system_score_codex":0.0013297606,"about_ca_system_score_gemma":0.002306052,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04309219,0.00029775337,0.9159996,0.0007667485,0.00037568653,0.00013387571,0.0004212653,0.010296172,0.02861666],"genre_scores_gemma":[0.42793798,0.00029638654,0.538905,0.00065318064,0.0001081053,0.00019136464,0.00058530923,0.007409689,0.023913004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815184,0.0001869292,0.00013450185,0.00031139082,0.0009792924,0.00023612518],"domain_scores_gemma":[0.9964485,0.00096433575,0.00030093436,0.0013899094,0.0007524392,0.00014389116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016935888,0.00064152613,0.0005852364,0.0013274084,0.0018456674,0.003177758,0.0013774439,0.0010759409,0.00822369],"category_scores_gemma":[0.008257407,0.000765328,0.0016701013,0.0009316946,0.0033036312,0.005889469,0.0040590987,0.0024535987,0.0020763236],"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.0001857181,0.00009042396,0.004543703,0.00035915087,0.00007452144,0.0003415809,0.0012507004,0.0112499725,0.011017206,0.85215,0.010014453,0.10872249],"study_design_scores_gemma":[0.00004707799,0.000055758628,0.0010235327,0.00018942256,0.000097198885,0.00050895684,0.0003944578,0.044562496,0.05182938,0.7769426,0.12418152,0.0001676361],"about_ca_topic_score_codex":0.0035163455,"about_ca_topic_score_gemma":0.007167507,"teacher_disagreement_score":0.00822369,"about_ca_system_score_codex":0.0015106767,"about_ca_system_score_gemma":0.002573404,"threshold_uncertainty_score":0.027510941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03134104,0.00042982106,0.9475266,0.00055239873,0.00012058774,0.00031123945,0.0003410778,0.014856832,0.004520402],"genre_scores_gemma":[0.30810735,0.0003557739,0.68013936,0.00057521707,0.00017292895,0.00043610495,0.0013956869,0.003861637,0.004956041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934608,0.0013146086,0.00033586967,0.0010545442,0.002816964,0.001017257],"domain_scores_gemma":[0.9907244,0.003846853,0.0005206686,0.0032131854,0.0014033819,0.00029143508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032060565,0.0023798428,0.0015223701,0.002402756,0.0012781688,0.0029966643,0.0031107129,0.00094795856,0.0038926883],"category_scores_gemma":[0.011975425,0.0011123467,0.0034481206,0.0015790015,0.0024599512,0.0047432543,0.0061230017,0.0028761649,0.0017080699],"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.0011262324,0.000540707,0.010689345,0.001133961,0.00042934675,0.0010376147,0.0018109924,0.23171407,0.075133845,0.09787559,0.015649978,0.56285834],"study_design_scores_gemma":[0.00013688143,0.00022284595,0.0019136869,0.0001192366,0.00025118358,0.0002587848,0.0002876385,0.7123999,0.063416585,0.20176063,0.01911439,0.00011817303],"about_ca_topic_score_codex":0.0082319705,"about_ca_topic_score_gemma":0.010456862,"teacher_disagreement_score":0.0082319705,"about_ca_system_score_codex":0.0020094095,"about_ca_system_score_gemma":0.004686271,"threshold_uncertainty_score":0.016955435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53222567,0.012756603,0.2998557,0.0030951574,0.001887429,0.00078545255,0.0054213307,0.060851466,0.083121195],"genre_scores_gemma":[0.911258,0.0011475196,0.04431786,0.0011253584,0.00016289513,0.00015842453,0.0033597427,0.00042276972,0.038047507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981433,0.00001400176,0.000015610054,0.000032003678,0.00008772182,0.000036356127],"domain_scores_gemma":[0.999428,0.000081211765,0.00007435962,0.0001714513,0.00020958748,0.00003544132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002261543,0.0005081519,0.00025023255,0.0004251579,0.00046756843,0.00083313545,0.0011763939,0.0005232255,0.007137512],"category_scores_gemma":[0.00066322245,0.00015529494,0.0002157934,0.000625954,0.00031925138,0.001514376,0.0005107742,0.0002772395,0.0019278306],"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.0011532819,0.00016191677,0.011792714,0.0008266474,0.00007509757,0.0019471424,0.0002777088,0.0043462287,0.23644589,0.0042631165,0.065652244,0.67305803],"study_design_scores_gemma":[0.00014650269,0.001334908,0.011140466,0.000115082556,0.00018081076,0.00419278,0.00030112793,0.08237481,0.7189771,0.003258498,0.17786174,0.000116204596],"about_ca_topic_score_codex":0.0017335518,"about_ca_topic_score_gemma":0.0039594183,"teacher_disagreement_score":0.007137512,"about_ca_system_score_codex":0.00050994917,"about_ca_system_score_gemma":0.00041562133,"threshold_uncertainty_score":0.023877323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016103186,0.0013375827,0.79951626,0.0011609539,0.00083031773,0.00038296665,0.003150903,0.086391605,0.0911261],"genre_scores_gemma":[0.23168704,0.0013499596,0.5830662,0.0015886206,0.0003550013,0.0007245287,0.0108542945,0.020241635,0.15013273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988268,0.00015814384,0.00008300677,0.00028566268,0.0004734051,0.00017296468],"domain_scores_gemma":[0.9985952,0.0003131176,0.00008069866,0.00063973345,0.00026303955,0.000108193824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012973864,0.0008950488,0.00068603543,0.0007550558,0.00076281023,0.0023336068,0.0029773049,0.0010605812,0.04611912],"category_scores_gemma":[0.0032513398,0.00068669283,0.0012272758,0.00068069575,0.0009770199,0.0042146174,0.0045855395,0.0016258485,0.012641728],"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.0011542119,0.00022645858,0.0030177378,0.00094623485,0.00015238948,0.00065193983,0.00096212723,0.019199772,0.022672804,0.32036522,0.17856573,0.45208523],"study_design_scores_gemma":[0.00017357501,0.00018348602,0.0006752388,0.00015375283,0.00007083116,0.0006608452,0.00016309875,0.08264513,0.029491736,0.15299433,0.73267597,0.00011200541],"about_ca_topic_score_codex":0.0013216226,"about_ca_topic_score_gemma":0.0018923808,"teacher_disagreement_score":0.04611912,"about_ca_system_score_codex":0.00074364187,"about_ca_system_score_gemma":0.0012287187,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014940155,0.0002585714,0.92850244,0.0003570098,0.00012686597,0.000115524,0.00028146038,0.051338125,0.004079928],"genre_scores_gemma":[0.13296135,0.00042622696,0.8450055,0.00077810837,0.00012145678,0.0002371221,0.0019884491,0.012605477,0.005876334],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978631,0.0004120786,0.00023508322,0.00048793107,0.00074311934,0.00025876224],"domain_scores_gemma":[0.9976163,0.0008591635,0.00020758958,0.00080476253,0.0003959244,0.00011620634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023100334,0.001036929,0.00065301376,0.0008303714,0.0005107394,0.002716888,0.003251672,0.00079823536,0.00329788],"category_scores_gemma":[0.0042428356,0.00084265403,0.0013661106,0.0010212867,0.0017062016,0.004428662,0.0029112245,0.0028069774,0.0013098059],"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.001604078,0.00077326404,0.007951016,0.00106194,0.00024017727,0.0009596175,0.002287536,0.08814373,0.08541652,0.15318732,0.057789125,0.6005856],"study_design_scores_gemma":[0.00025702812,0.0008901311,0.0018708952,0.00019998691,0.00025112988,0.000638784,0.00048946985,0.5545628,0.20247681,0.09913467,0.13899091,0.00023739116],"about_ca_topic_score_codex":0.0020654416,"about_ca_topic_score_gemma":0.0023720644,"teacher_disagreement_score":0.00329788,"about_ca_system_score_codex":0.00081568037,"about_ca_system_score_gemma":0.0014569965,"threshold_uncertainty_score":0.012216806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008598104,0.0015904226,0.95575196,0.0008639436,0.0003388919,0.00018539892,0.00009235096,0.0050646127,0.027514314],"genre_scores_gemma":[0.3127927,0.0031935375,0.63146365,0.0011152347,0.0005963796,0.0006255282,0.00045387284,0.0020625056,0.047696657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628484,0.00080398517,0.0002917687,0.0005104863,0.0017043836,0.00040442604],"domain_scores_gemma":[0.99358565,0.0023450775,0.00046246906,0.0021422112,0.0011172434,0.0003472872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005467789,0.0008448207,0.00070115435,0.0007800511,0.0012978276,0.0062212124,0.0023861874,0.0010765473,0.0067883246],"category_scores_gemma":[0.010611997,0.0010026471,0.00096264767,0.0011582004,0.0032035764,0.0066959267,0.0032503465,0.002785483,0.0018538118],"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.00019253766,0.00008621919,0.0010354372,0.0002718766,0.000040786454,0.0002789902,0.001213274,0.011336272,0.0056234817,0.8654419,0.007433069,0.10704618],"study_design_scores_gemma":[0.00030454015,0.00013602854,0.0005949565,0.00012995156,0.00013960914,0.0007759048,0.00024181651,0.07506311,0.013223965,0.6276837,0.28160515,0.00010129222],"about_ca_topic_score_codex":0.0028428421,"about_ca_topic_score_gemma":0.0027994888,"teacher_disagreement_score":0.0067883246,"about_ca_system_score_codex":0.0013921923,"about_ca_system_score_gemma":0.0022153754,"threshold_uncertainty_score":0.028916776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114526935,0.0005742201,0.97528833,0.0011082449,0.00026923406,0.00006061375,0.000070886155,0.00078726653,0.010388508],"genre_scores_gemma":[0.38436574,0.0013586303,0.59406525,0.0016424055,0.00055118906,0.00029192845,0.00022153364,0.0008852047,0.016618052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99166733,0.0025127002,0.0007674942,0.0017801813,0.0027054704,0.00056680915],"domain_scores_gemma":[0.98245066,0.0049093654,0.0014264039,0.0077026803,0.002949542,0.0005612633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007998979,0.0010669677,0.00069516257,0.001956026,0.0017044848,0.0056340094,0.0026559455,0.0018759462,0.00310593],"category_scores_gemma":[0.018530115,0.0014399943,0.0025430177,0.001026832,0.0099295955,0.012716672,0.0074253636,0.005827881,0.0010054158],"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.000029614028,0.0000113497,0.0004992586,0.00010063495,0.000021900334,0.00009541583,0.0011047239,0.0031690167,0.0018130356,0.97785383,0.00068172184,0.014619492],"study_design_scores_gemma":[0.000042643205,0.00009869898,0.00024065154,0.00017850325,0.00008990639,0.0003955674,0.0003243762,0.016970297,0.0060862526,0.9150967,0.06039937,0.00007707693],"about_ca_topic_score_codex":0.0022619404,"about_ca_topic_score_gemma":0.001701107,"teacher_disagreement_score":0.007998979,"about_ca_system_score_codex":0.0026901811,"about_ca_system_score_gemma":0.0028430556,"threshold_uncertainty_score":0.042303145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99219936,0.000242302,0.004297083,0.00003981681,0.000023103259,0.00002645285,0.00009446382,0.0012704146,0.0018069057],"genre_scores_gemma":[0.99230486,0.00007610666,0.0063656815,0.000017508002,0.000007686492,0.000026590282,0.00037443524,0.00025436183,0.00057271245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725336,0.0005264292,0.00022392492,0.00053670665,0.00089690706,0.000562593],"domain_scores_gemma":[0.9892917,0.004833221,0.0009500818,0.0027192303,0.001794906,0.00041086413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015369824,0.0009086018,0.00047861354,0.00089063356,0.0004937462,0.0010807425,0.0018847658,0.00063192425,0.0012689945],"category_scores_gemma":[0.012845359,0.0004536086,0.0003925562,0.0013698804,0.0010873968,0.0017278938,0.0008547263,0.0010087456,0.00039450475],"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.0039450605,0.0012648574,0.08975168,0.00085009856,0.00037796737,0.0007442662,0.0022214036,0.46604207,0.217824,0.012951517,0.00570092,0.19832607],"study_design_scores_gemma":[0.00012300728,0.0016574922,0.032835145,0.00006177795,0.00013807148,0.00028132167,0.00040793756,0.7760918,0.18084982,0.002657008,0.004807335,0.0000893305],"about_ca_topic_score_codex":0.0028222317,"about_ca_topic_score_gemma":0.0014914541,"teacher_disagreement_score":0.0028222317,"about_ca_system_score_codex":0.0011487264,"about_ca_system_score_gemma":0.00091194914,"threshold_uncertainty_score":0.008334637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54573697,0.011276685,0.24845222,0.0066200946,0.001026576,0.0010303301,0.00309391,0.018109508,0.16465367],"genre_scores_gemma":[0.9557326,0.0013759037,0.019783778,0.0012052319,0.00015228085,0.00016705554,0.0005859679,0.00033870857,0.020658517],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831545,0.00030340735,0.00016655758,0.00019266442,0.0007549814,0.0002668427],"domain_scores_gemma":[0.99543154,0.000730234,0.0004893147,0.0027744446,0.00042821481,0.00014617709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062311866,0.00053839106,0.00064546557,0.00089968165,0.0009648417,0.0021985413,0.0007424329,0.0014543951,0.0062367707],"category_scores_gemma":[0.005770042,0.00039772084,0.00048968,0.0006130239,0.00086974027,0.002155335,0.0030039172,0.0011994666,0.0031196927],"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.00157063,0.00024590775,0.017413793,0.0011594808,0.0002532143,0.00314353,0.0030346662,0.007615865,0.18546027,0.08405597,0.067376256,0.62867045],"study_design_scores_gemma":[0.00026643227,0.0009357943,0.014487807,0.00072422356,0.00037305578,0.0062260795,0.0010076489,0.06216708,0.4831308,0.032923773,0.39754927,0.00020801369],"about_ca_topic_score_codex":0.0010453933,"about_ca_topic_score_gemma":0.0009081924,"teacher_disagreement_score":0.0062367707,"about_ca_system_score_codex":0.00058141217,"about_ca_system_score_gemma":0.00068959023,"threshold_uncertainty_score":0.02086407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057889763,0.0039737737,0.93099195,0.0012561043,0.00085389277,0.0011555608,0.0018165634,0.012263552,0.0418996],"genre_scores_gemma":[0.17202789,0.005008447,0.7512128,0.004134981,0.0013553515,0.002490567,0.005789698,0.005291196,0.0526892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98992026,0.0015766195,0.0017240796,0.001868341,0.0041986024,0.0007120369],"domain_scores_gemma":[0.99490297,0.0019589239,0.00062868575,0.0010769694,0.0011516749,0.00028078383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058718454,0.0021040135,0.00150988,0.0033461275,0.0016050893,0.006241339,0.0033917606,0.003641261,0.023996418],"category_scores_gemma":[0.009640433,0.0019058017,0.0032170317,0.0035969901,0.0031363321,0.009285386,0.0037679742,0.00408967,0.005745314],"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.00012281748,0.000091414375,0.00091624673,0.00075111596,0.00012226542,0.0005791352,0.0008274793,0.0029765093,0.003828007,0.8424999,0.02638003,0.12090517],"study_design_scores_gemma":[0.00020401599,0.00015908296,0.0006316051,0.00036745213,0.00012807506,0.00176651,0.00024427744,0.014405663,0.004797979,0.37725812,0.59991074,0.00012644009],"about_ca_topic_score_codex":0.0032242218,"about_ca_topic_score_gemma":0.0028948712,"teacher_disagreement_score":0.023996418,"about_ca_system_score_codex":0.001827388,"about_ca_system_score_gemma":0.0020120782,"threshold_uncertainty_score":0.08027601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028491563,0.00017463435,0.9940655,0.00019466714,0.00003918568,0.000102763726,0.000059256883,0.00022930178,0.002285503],"genre_scores_gemma":[0.10186231,0.00072831195,0.8928348,0.00015407392,0.00007352301,0.00027622943,0.00024230673,0.00017204667,0.0036563128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990889,0.00034116718,0.000041581658,0.00016234248,0.0002822216,0.0000837576],"domain_scores_gemma":[0.9989525,0.00050909683,0.00011139889,0.00018810804,0.00018935336,0.00004952351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086533884,0.0012207999,0.0010875175,0.001744682,0.0014098698,0.0019905516,0.0024102298,0.0011251715,0.0036910814],"category_scores_gemma":[0.0031373117,0.0011402745,0.0014118099,0.0028600418,0.0015758766,0.0021792836,0.0013042402,0.0017161219,0.0009715099],"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.000058330475,0.00012175505,0.00042812433,0.00035163458,0.00006785711,0.0001945336,0.00023998864,0.6961838,0.005269936,0.20918477,0.005243331,0.08265593],"study_design_scores_gemma":[0.000026001819,0.000081516286,0.00013634299,0.000034102624,0.000029973096,0.00013342335,0.00007996546,0.83892983,0.00204202,0.15089436,0.007583834,0.000028626453],"about_ca_topic_score_codex":0.0059309737,"about_ca_topic_score_gemma":0.010797038,"teacher_disagreement_score":0.0059309737,"about_ca_system_score_codex":0.002540908,"about_ca_system_score_gemma":0.0033056696,"threshold_uncertainty_score":0.018435597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007256277,0.0024453949,0.93696046,0.005107038,0.0015529037,0.00031072233,0.0007763238,0.0033821054,0.042208817],"genre_scores_gemma":[0.26636335,0.005025794,0.67083776,0.005587292,0.002457153,0.0014413333,0.0029377819,0.0047915545,0.040558048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97091115,0.009012184,0.0028346616,0.0048584733,0.010662445,0.0017211055],"domain_scores_gemma":[0.8929574,0.07078043,0.0051581385,0.018657744,0.011329813,0.0011164073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0138040995,0.0022819226,0.0018884932,0.0028549833,0.004135079,0.010363236,0.0030819203,0.0038933484,0.023026032],"category_scores_gemma":[0.10349458,0.0020285512,0.0039300667,0.0027646008,0.0076762517,0.029413342,0.009088172,0.008156873,0.008481462],"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.000073563024,0.000045721124,0.0004194684,0.0004601282,0.00006602321,0.00022997143,0.0006746529,0.0012519406,0.0012492328,0.9498816,0.010693491,0.034954086],"study_design_scores_gemma":[0.00004441628,0.000031406955,0.00013033932,0.00034237048,0.000091363065,0.00031862367,0.000101546226,0.0056215217,0.004575363,0.90661776,0.082072526,0.000052636995],"about_ca_topic_score_codex":0.0009110546,"about_ca_topic_score_gemma":0.0011501077,"teacher_disagreement_score":0.023026032,"about_ca_system_score_codex":0.002530466,"about_ca_system_score_gemma":0.004215606,"threshold_uncertainty_score":0.077029705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009821193,0.0007760624,0.94816464,0.0012465473,0.00018991821,0.000091310874,0.00019173589,0.00068331405,0.038835313],"genre_scores_gemma":[0.5010379,0.001972317,0.45458406,0.0013154102,0.00054658746,0.0004894175,0.00042187932,0.0004810341,0.03915147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702305,0.0007469368,0.00020902551,0.00082340883,0.00086209096,0.00033547595],"domain_scores_gemma":[0.99457353,0.0028871163,0.00036533756,0.0010300727,0.0009005218,0.00024347128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003593864,0.00072642555,0.0005436979,0.0020535588,0.0017566435,0.0034276454,0.0018302066,0.0015534615,0.0076905657],"category_scores_gemma":[0.007351719,0.0009038786,0.001930396,0.0011424251,0.007116805,0.00824744,0.00381921,0.0040905303,0.0012155187],"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.0000053895214,0.0000040137174,0.00009448866,0.000025646508,0.000004752917,0.000044567823,0.00016029664,0.0013614856,0.000302253,0.99452764,0.00043797388,0.0030315195],"study_design_scores_gemma":[0.000026311149,0.00002710548,0.00013572142,0.000044326895,0.00003165481,0.00017019887,0.00007855897,0.013321774,0.000991472,0.95177025,0.033379365,0.000023329265],"about_ca_topic_score_codex":0.0025376666,"about_ca_topic_score_gemma":0.0019122688,"teacher_disagreement_score":0.0076905657,"about_ca_system_score_codex":0.0023877386,"about_ca_system_score_gemma":0.0015598907,"threshold_uncertainty_score":0.02572757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013414106,0.00017930543,0.9664128,0.00015654891,0.000073760275,0.00016961199,0.0002733698,0.014696631,0.0046239244],"genre_scores_gemma":[0.19178228,0.00039685014,0.7926973,0.00027190754,0.00008561443,0.00036337532,0.0019476374,0.0049413103,0.007513721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817777,0.00028362309,0.0001520033,0.0003392252,0.0008895234,0.00015796814],"domain_scores_gemma":[0.99713504,0.0008671598,0.00018132845,0.0011180844,0.0006489424,0.000049495346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084966613,0.0008503784,0.00076557713,0.0010146778,0.00051650486,0.0010941473,0.0015953872,0.0005641002,0.0035172596],"category_scores_gemma":[0.004981362,0.0006005069,0.000802696,0.0009711388,0.0010675463,0.0020331135,0.001769138,0.0014245076,0.0019473425],"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.0003294278,0.00014051015,0.0014909277,0.00043541924,0.000059364364,0.0008389952,0.0012244912,0.056581166,0.09666581,0.124192715,0.015702283,0.7023389],"study_design_scores_gemma":[0.00010009744,0.00014622613,0.00066098844,0.000125684,0.00007574495,0.0012807817,0.00017898035,0.432193,0.37397486,0.09809538,0.093067355,0.00010090877],"about_ca_topic_score_codex":0.0016951375,"about_ca_topic_score_gemma":0.0019180677,"teacher_disagreement_score":0.0035172596,"about_ca_system_score_codex":0.0008980275,"about_ca_system_score_gemma":0.00122034,"threshold_uncertainty_score":0.011766434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052735903,0.00031269016,0.9845063,0.000208178,0.000067296074,0.00009706784,0.00017097704,0.0029082608,0.0064556934],"genre_scores_gemma":[0.27451533,0.0009175846,0.7156302,0.0006029842,0.00023031243,0.00044388845,0.0005222628,0.0015500145,0.005587446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678624,0.0007613129,0.0003035253,0.00058463926,0.0013158398,0.00024844607],"domain_scores_gemma":[0.99760854,0.0010671512,0.00019623355,0.0006914236,0.0003784886,0.00005814305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014682644,0.0009279772,0.00059317535,0.0022638158,0.0011098798,0.0026301127,0.00148414,0.0010027889,0.006620675],"category_scores_gemma":[0.0071581784,0.00069319806,0.0022452392,0.0020514396,0.0024591684,0.0053852038,0.0040325066,0.0033214553,0.0021366521],"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.00007618556,0.000040412484,0.0009399451,0.00024666212,0.00004916292,0.0002495652,0.0004362767,0.017388746,0.008954605,0.84222364,0.002827978,0.12656675],"study_design_scores_gemma":[0.00001567107,0.000032987373,0.00031514486,0.00012141065,0.000046822177,0.00017529966,0.00009916803,0.069257975,0.011260028,0.8861756,0.032446597,0.00005335173],"about_ca_topic_score_codex":0.002191838,"about_ca_topic_score_gemma":0.002267662,"teacher_disagreement_score":0.006620675,"about_ca_system_score_codex":0.0015353521,"about_ca_system_score_gemma":0.00162757,"threshold_uncertainty_score":0.02214837},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016352667,0.0012226714,0.32725537,0.0011325555,0.001445828,0.0006856443,0.026723634,0.45888987,0.16629185],"genre_scores_gemma":[0.08199078,0.001556838,0.3374944,0.0024802112,0.00032028602,0.0015781692,0.10544889,0.17786138,0.29126903],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985843,0.0001635771,0.00013112064,0.00035539342,0.00056434073,0.00020131326],"domain_scores_gemma":[0.99833137,0.0003683571,0.00013534396,0.00036643198,0.0006622646,0.00013620775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979164,0.0014343597,0.0007320888,0.0011063041,0.0006509527,0.0021936556,0.002785806,0.0010047068,0.14247346],"category_scores_gemma":[0.004234956,0.0010933914,0.0011284917,0.0008083146,0.00054645014,0.0028656921,0.0031865383,0.001853608,0.10379191],"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.0011892365,0.00023387551,0.0035931347,0.0016096447,0.00012719278,0.00058105227,0.000617735,0.0072283135,0.0270824,0.05501887,0.5967607,0.3059579],"study_design_scores_gemma":[0.00011043307,0.000121701465,0.00095562066,0.00012221519,0.00003551154,0.00045735497,0.00009272573,0.013551976,0.028485706,0.009921245,0.9460728,0.00007281236],"about_ca_topic_score_codex":0.001327083,"about_ca_topic_score_gemma":0.0018520164,"teacher_disagreement_score":0.14247346,"about_ca_system_score_codex":0.0008220342,"about_ca_system_score_gemma":0.001726127,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010949923,0.0001896846,0.9737124,0.0004455355,0.00012307431,0.00008724538,0.00017064458,0.0069309077,0.007390627],"genre_scores_gemma":[0.27295044,0.00040761626,0.70837665,0.0005271788,0.0001858817,0.0003494171,0.00060658186,0.0023517546,0.014244497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706393,0.0007445195,0.00022256316,0.0005639105,0.0010792386,0.00032586878],"domain_scores_gemma":[0.9944423,0.0023625658,0.00025343284,0.0020083962,0.00076037063,0.00017297639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027698749,0.00058419065,0.0007196863,0.0011817646,0.0015092965,0.0032384573,0.0026370485,0.00090814044,0.006175023],"category_scores_gemma":[0.01257804,0.00077460665,0.0017353881,0.0013475138,0.0034680082,0.008937418,0.0060681594,0.0020911281,0.0014316754],"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.00031962252,0.000052184358,0.0015527656,0.0002217762,0.00005113277,0.0002257321,0.0010426933,0.025372172,0.006595007,0.82736856,0.008553873,0.12864442],"study_design_scores_gemma":[0.000059128943,0.00007496443,0.00028804794,0.00008294958,0.00010514679,0.00026006217,0.00015767086,0.23083621,0.021313407,0.66911465,0.0776368,0.00007096339],"about_ca_topic_score_codex":0.0027229618,"about_ca_topic_score_gemma":0.004135415,"teacher_disagreement_score":0.006175023,"about_ca_system_score_codex":0.0015369238,"about_ca_system_score_gemma":0.002324081,"threshold_uncertainty_score":0.02065748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12952098,0.003598977,0.72316396,0.0011636919,0.0012319158,0.000510593,0.0034618902,0.068478495,0.068869494],"genre_scores_gemma":[0.6428048,0.00082902965,0.28433052,0.0018193044,0.00022669934,0.0005621309,0.006524111,0.0029921131,0.059911203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.00007596282,0.000039214305,0.00012753908,0.0002449408,0.00010997871],"domain_scores_gemma":[0.99858165,0.0001533003,0.00012779045,0.000530265,0.00047018606,0.00013679797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037251247,0.0006619094,0.0006368625,0.00074733,0.0005010651,0.00128825,0.0026201734,0.00072060997,0.019427305],"category_scores_gemma":[0.0016335236,0.00068914803,0.00047225333,0.0010007822,0.000564492,0.0021158876,0.0014810235,0.0008728535,0.0058862204],"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.0042770393,0.0004993984,0.005203089,0.0011333398,0.00020140511,0.00079861464,0.00036610433,0.05559044,0.302321,0.048987184,0.147183,0.43343952],"study_design_scores_gemma":[0.0005384676,0.0036494203,0.0047335173,0.00014456203,0.00018886063,0.0023561325,0.00009690453,0.34461907,0.2160142,0.022859512,0.40453655,0.00026283442],"about_ca_topic_score_codex":0.0019283014,"about_ca_topic_score_gemma":0.002338719,"teacher_disagreement_score":0.019427305,"about_ca_system_score_codex":0.0010706313,"about_ca_system_score_gemma":0.0014063121,"threshold_uncertainty_score":0.06499082},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008824726,0.00058168976,0.9330873,0.00048565184,0.0003184161,0.00023031993,0.00020606896,0.04480887,0.011456915],"genre_scores_gemma":[0.18400477,0.0008237356,0.77844274,0.0015008673,0.0002979419,0.000529894,0.0010830526,0.017214255,0.016102755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.00038344972,0.00019903111,0.0003423974,0.0009618272,0.00032189747],"domain_scores_gemma":[0.99819714,0.00032458687,0.00015275362,0.0007878572,0.00041122866,0.00012635298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015802273,0.0008749515,0.0006248784,0.001130332,0.0006294568,0.0023144116,0.003757123,0.00093965506,0.005986405],"category_scores_gemma":[0.004768519,0.00090853334,0.001267297,0.00054242584,0.001374934,0.0035560976,0.0037453063,0.00305908,0.0034018203],"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.00066328346,0.0003501427,0.0050213444,0.0009701179,0.00021582942,0.0009658742,0.0021151083,0.055598974,0.09377208,0.25114954,0.06898476,0.5201929],"study_design_scores_gemma":[0.00017115171,0.00026269295,0.0013364,0.0003953097,0.00017979927,0.00083851116,0.00014015674,0.29564613,0.09325008,0.10589471,0.5016448,0.00024009994],"about_ca_topic_score_codex":0.0017840858,"about_ca_topic_score_gemma":0.0023355214,"teacher_disagreement_score":0.005986405,"about_ca_system_score_codex":0.001291588,"about_ca_system_score_gemma":0.001877965,"threshold_uncertainty_score":0.020026505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092801474,0.00020582524,0.8433651,0.00034258782,0.00043270455,0.00025254313,0.0002888901,0.0487933,0.013517711],"genre_scores_gemma":[0.45834956,0.00019761833,0.5237679,0.00026293332,0.000085219486,0.0001985984,0.0008313919,0.007556821,0.008749916],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999257,0.00014557582,0.00009365527,0.00017846531,0.00017919455,0.0001461605],"domain_scores_gemma":[0.99814665,0.0003362346,0.00010583648,0.0010290353,0.00030165687,0.00008069402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078469625,0.0005157502,0.0003677988,0.0005276891,0.00057620055,0.00085862685,0.00088796363,0.0004134824,0.0043188976],"category_scores_gemma":[0.0036035394,0.0004371958,0.0008618987,0.00048257437,0.00043813663,0.001316312,0.0013433626,0.001002034,0.0018820721],"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.0007488701,0.00046343319,0.012236346,0.0009232559,0.00012752863,0.0014083827,0.0017659746,0.06682813,0.16668592,0.053088456,0.031656753,0.66406703],"study_design_scores_gemma":[0.0001783471,0.00045086606,0.006352603,0.00020999217,0.0001851632,0.0014527019,0.00059777,0.5367826,0.24001344,0.042367995,0.17127882,0.00012965538],"about_ca_topic_score_codex":0.0010406189,"about_ca_topic_score_gemma":0.001572394,"teacher_disagreement_score":0.0043188976,"about_ca_system_score_codex":0.00046799448,"about_ca_system_score_gemma":0.0013935985,"threshold_uncertainty_score":0.014448166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19946247,0.0011810836,0.7936674,0.0007065151,0.000049638584,0.00014266581,0.00005653711,0.000985027,0.0037485808],"genre_scores_gemma":[0.86262715,0.0004410355,0.13499177,0.00025941757,0.000043179647,0.00006524901,0.00006902049,0.0000742003,0.0014290062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989796,0.00034355497,0.00004912951,0.00016762319,0.00020383572,0.00025605332],"domain_scores_gemma":[0.9978478,0.0007214046,0.00028090517,0.0005291375,0.00031020804,0.00031054488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013485779,0.000660523,0.00074213016,0.00050299265,0.00070622354,0.0017632642,0.0017152833,0.0007017443,0.000999465],"category_scores_gemma":[0.0030289649,0.00057374866,0.00043092048,0.00059501134,0.0009832222,0.0026758397,0.0015367877,0.0015599962,0.00029428778],"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.00052504,0.00072113634,0.006391129,0.0003246996,0.00009874906,0.00026040815,0.0006272925,0.71624005,0.055688538,0.067780875,0.0040816236,0.14726043],"study_design_scores_gemma":[0.000022536547,0.00014776959,0.0005464783,0.000020398633,0.000016591548,0.00008532836,0.00006761322,0.97954834,0.0050044283,0.0129197,0.0016089841,0.000011800003],"about_ca_topic_score_codex":0.0027849264,"about_ca_topic_score_gemma":0.0032927948,"teacher_disagreement_score":0.0027849264,"about_ca_system_score_codex":0.00096065074,"about_ca_system_score_gemma":0.0015993372,"threshold_uncertainty_score":0.007132113},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35150594,0.0023472612,0.6025269,0.00045192873,0.00053612696,0.0005200611,0.0003305943,0.030290088,0.011491058],"genre_scores_gemma":[0.91021395,0.00025205617,0.086356826,0.00015460711,0.000153933,0.00013903796,0.00030915378,0.0004549728,0.0019655002],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987369,0.00021058577,0.00020636186,0.00021169445,0.0004018914,0.0002324942],"domain_scores_gemma":[0.99224514,0.0016310648,0.0009374344,0.002878362,0.001798286,0.0005097814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011998038,0.0006845868,0.0005655586,0.00074083736,0.0006665416,0.0014154884,0.0033520798,0.00048662935,0.0036551198],"category_scores_gemma":[0.00726121,0.00042067666,0.0003455863,0.0007412113,0.0005065905,0.0014641058,0.0011561646,0.0011647297,0.00082138943],"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.0029939488,0.00143503,0.020362932,0.0010009726,0.00027993086,0.0009833467,0.0012634589,0.045415267,0.3874819,0.029132837,0.018155057,0.4914953],"study_design_scores_gemma":[0.00041544426,0.00074941746,0.005535547,0.00007552184,0.00023852474,0.0006726876,0.00015471858,0.75248307,0.19409415,0.008568783,0.036878835,0.00013337258],"about_ca_topic_score_codex":0.0014706902,"about_ca_topic_score_gemma":0.0014866387,"teacher_disagreement_score":0.0036551198,"about_ca_system_score_codex":0.00092317787,"about_ca_system_score_gemma":0.0015779554,"threshold_uncertainty_score":0.012227535},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049166195,0.0044720205,0.0920455,0.012081448,0.021686474,0.0017741937,0.039151557,0.055546872,0.7683253],"genre_scores_gemma":[0.022984913,0.0024113567,0.013008275,0.0010286247,0.003594474,0.00051595125,0.01687057,0.0073185894,0.93226725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887687,0.00022565702,0.000054086348,0.00031513636,0.00030752603,0.00022074966],"domain_scores_gemma":[0.99726534,0.0007672554,0.000054477965,0.00082461885,0.0003952725,0.000693092],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021621315,0.0023485892,0.0025815978,0.00090425805,0.0020454116,0.0055817883,0.0019316108,0.0028091017,0.8161556],"category_scores_gemma":[0.0039095986,0.00063371524,0.0020669834,0.0017760771,0.0005641359,0.0032919452,0.003494889,0.0027191988,0.6872247],"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.0007584573,0.00022542806,0.00023787229,0.00022983651,0.000032310283,0.000074923046,0.000057189663,0.00029946744,0.004996518,0.003668498,0.88625103,0.10316852],"study_design_scores_gemma":[0.00028255302,0.00024162626,0.0013988937,0.000090888694,0.00006212925,0.00019464642,0.000061510684,0.0038932438,0.005200736,0.0054305955,0.98309004,0.000053147134],"about_ca_topic_score_codex":0.0016444261,"about_ca_topic_score_gemma":0.0029799007,"teacher_disagreement_score":0.8161556,"about_ca_system_score_codex":0.0009001542,"about_ca_system_score_gemma":0.0016388812,"threshold_uncertainty_score":0.2622317},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096776355,0.002517416,0.16764194,0.007826295,0.011784811,0.002737115,0.06706472,0.20072743,0.53002256],"genre_scores_gemma":[0.058499616,0.0020189474,0.043564968,0.0011818551,0.0028110943,0.001012032,0.051916264,0.027495613,0.81149954],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881256,0.00021194563,0.000058782472,0.00025399736,0.0003580164,0.00030468407],"domain_scores_gemma":[0.9976069,0.00048231723,0.00005353224,0.00096807565,0.00033555142,0.0005535543],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001475657,0.0024014087,0.0030671137,0.00076912,0.0016462478,0.004095409,0.0022004722,0.0020070958,0.7179961],"category_scores_gemma":[0.0041529275,0.00069523347,0.0015347141,0.002030615,0.00031812873,0.0026020985,0.0028739106,0.002108934,0.5909374],"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.0011249802,0.00027834135,0.00033811547,0.0002459995,0.000031782598,0.00005370405,0.000046033827,0.0009983142,0.00860024,0.002571153,0.8433539,0.14235744],"study_design_scores_gemma":[0.00051753,0.00030958556,0.00240249,0.0000810307,0.00007947449,0.00021823609,0.00007300261,0.020787189,0.019949118,0.0061306017,0.949342,0.000109841334],"about_ca_topic_score_codex":0.0019681894,"about_ca_topic_score_gemma":0.003595377,"teacher_disagreement_score":0.7179961,"about_ca_system_score_codex":0.0007826781,"about_ca_system_score_gemma":0.0015258255,"threshold_uncertainty_score":0.40224427},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032642488,0.0006619223,0.18079355,0.0011945907,0.00059489324,0.0006451971,0.06451356,0.69692665,0.051405348],"genre_scores_gemma":[0.07757071,0.002326026,0.25833064,0.0038729117,0.000505961,0.002520476,0.3786293,0.15437467,0.12186924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980545,0.00025750557,0.00017890331,0.00033550774,0.0009264867,0.00024708017],"domain_scores_gemma":[0.9953607,0.0017634607,0.00025428622,0.0014148889,0.0009595426,0.00024717188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028058605,0.0017809863,0.0013529448,0.002523063,0.0009122647,0.0035422158,0.00694082,0.0020349168,0.14127041],"category_scores_gemma":[0.008861805,0.0020473162,0.0017059693,0.0020232487,0.00077721156,0.0065470575,0.0036621124,0.0033003353,0.099530205],"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.0008937303,0.0002684901,0.0020901856,0.0012667568,0.00009092918,0.00037523135,0.00019060037,0.0046612825,0.0036725118,0.021766033,0.8099876,0.15473665],"study_design_scores_gemma":[0.00059988495,0.00018639282,0.0014077123,0.00024028771,0.00006332172,0.00054802815,0.00013953309,0.057721894,0.011621263,0.045100067,0.8822428,0.00012883107],"about_ca_topic_score_codex":0.0027760894,"about_ca_topic_score_gemma":0.004596274,"teacher_disagreement_score":0.14127041,"about_ca_system_score_codex":0.001222557,"about_ca_system_score_gemma":0.0028413623,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.326402,0.00050423667,0.66297835,0.00024634085,0.00005055239,0.00037251422,0.00045531878,0.0044249394,0.00456577],"genre_scores_gemma":[0.69362557,0.00028321947,0.3031577,0.00007325181,0.0000346593,0.00042125472,0.000867665,0.0008178897,0.0007188162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9828599,0.0035631023,0.0013877845,0.0012776452,0.010363925,0.0005475459],"domain_scores_gemma":[0.96092826,0.019194512,0.0062068636,0.0069809104,0.005980758,0.00070867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063133803,0.0008986095,0.0007820454,0.0039493437,0.0009424364,0.002405282,0.0018945842,0.00087013684,0.00073372945],"category_scores_gemma":[0.040477615,0.0009790172,0.0007068581,0.0024762093,0.0016443213,0.0040122992,0.0017252563,0.0018379505,0.00023128033],"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.00055097346,0.00088577956,0.124752216,0.0014735229,0.0006626115,0.0005608319,0.004898149,0.18458949,0.18664813,0.10093145,0.0030171731,0.3910296],"study_design_scores_gemma":[0.00006635187,0.00089648354,0.058014076,0.00021522993,0.00022137318,0.001093228,0.0007807444,0.73479736,0.12421868,0.060614936,0.018840665,0.0002409512],"about_ca_topic_score_codex":0.0017098832,"about_ca_topic_score_gemma":0.0020384504,"teacher_disagreement_score":0.0063133803,"about_ca_system_score_codex":0.0010936126,"about_ca_system_score_gemma":0.0014940497,"threshold_uncertainty_score":0.033388734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072799385,0.0013209946,0.5287293,0.0015180004,0.0015032425,0.0011198851,0.00535654,0.20403224,0.18362032],"genre_scores_gemma":[0.6641684,0.0011808341,0.16815142,0.0018441898,0.00039691065,0.0009973543,0.012045371,0.024550993,0.1266645],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884546,0.00013432167,0.000087199965,0.00023404967,0.0004922705,0.00020671247],"domain_scores_gemma":[0.99762887,0.00030556094,0.00014322514,0.0012296586,0.0005001337,0.00019269853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082806067,0.0010726864,0.0005372495,0.0005559768,0.0007268137,0.0021906483,0.0028986987,0.00066972437,0.035934296],"category_scores_gemma":[0.0034305037,0.00059981534,0.0005399861,0.00069185137,0.00063471985,0.0038837332,0.002981774,0.0015195141,0.012775769],"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.0017326854,0.00035188784,0.007658638,0.0006802732,0.0001382206,0.0005493624,0.0007659123,0.032917313,0.032398753,0.090817414,0.3319378,0.50005174],"study_design_scores_gemma":[0.00017700139,0.00028341447,0.002880476,0.00011632881,0.00006845855,0.0005910753,0.0001985659,0.19340464,0.04043894,0.03067019,0.7310409,0.00012996465],"about_ca_topic_score_codex":0.0020422663,"about_ca_topic_score_gemma":0.001881473,"teacher_disagreement_score":0.035934296,"about_ca_system_score_codex":0.00075746,"about_ca_system_score_gemma":0.0011643586,"threshold_uncertainty_score":0.1202122},"labels":[],"label_agreement":null}]}