{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":167,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":167,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"4599bf974945","filters":{"venue":"ACM SIGPLAN Notices"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Philippe Charles","is_ca":false},{"name":"Christian Grothoff","is_ca":false},{"name":"Vijay Saraswat","is_ca":false},{"name":"Christopher Donawa","is_ca":true},{"name":"Allan Kielstra","is_ca":true},{"name":"Kemal Ebci̇oğlu","is_ca":false},{"name":"Christoph von Praun","is_ca":false},{"name":"Vivek Sarkar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01662160194682793,"gpt":0.2513658921889296,"spread":0.2347442902421016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567425,0.0007791742,0.0003200675,0.0007861108,0.001148741,0.003252088,0.001206216,0.001177815,0.4946111],"category_scores_gemma":[0.002080694,0.0003307122,0.0004382737,0.0008925254,0.0006989281,0.003073917,0.001989358,0.001164026,0.2551121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009650807,"about_ca_system_score_gemma":0.001294488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002766696,"about_ca_topic_score_gemma":0.002584965,"domain_scores_codex":[0.9993346,0.0001111689,0.00004398743,0.0001395513,0.0002858962,0.00008478879],"domain_scores_gemma":[0.9991184,0.0001613822,0.00006331213,0.0001579922,0.0003730957,0.0001257356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001481437,0.0000662132,0.0008993577,0.0003050747,0.000007933632,0.0002600032,0.0004709049,0.0004494567,0.003136713,0.1132136,0.6638108,0.2172319],"study_design_scores_gemma":[0.000005794308,0.00002359383,0.0001994341,0.00003218924,0.000001455787,0.0001069808,0.00005823712,0.0002294614,0.0004199606,0.002541215,0.9963755,0.000006123834],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.003711232,0.0008660269,0.03574886,0.003246396,0.003654956,0.0003286202,0.003463817,0.008431038,0.940549],"genre_scores_gemma":[0.009431582,0.0007565318,0.01061454,0.001033712,0.0004636195,0.0001604733,0.004361719,0.001573677,0.971604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4946111,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marc Berndl","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Feng Qian","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Navindra Umanee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06622918099250913,"gpt":0.3433915543306719,"spread":0.2771623733381628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443804,0.001703843,0.001324593,0.003023247,0.001092083,0.003736852,0.001942666,0.001024604,0.008063818],"category_scores_gemma":[0.008767108,0.001101211,0.00286956,0.002028926,0.001955392,0.005200544,0.002332012,0.002857478,0.001599664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001789295,"about_ca_system_score_gemma":0.002071286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004551611,"about_ca_topic_score_gemma":0.004347458,"domain_scores_codex":[0.9961019,0.001034945,0.000349974,0.0006029072,0.001707229,0.0002031268],"domain_scores_gemma":[0.9953081,0.003023024,0.0002627546,0.0006142019,0.0007281641,0.00006372571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002623484,0.00008637081,0.0009895165,0.0007501561,0.0001524264,0.0002308729,0.000459669,0.2199725,0.007729187,0.5605205,0.005291875,0.2035547],"study_design_scores_gemma":[0.00008514996,0.00007864981,0.000136425,0.0001587367,0.00009921798,0.0001669432,0.0001177125,0.5137652,0.01920722,0.4166424,0.04947909,0.00006327355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00098889,0.00006783775,0.9968433,0.000065778,0.00002123855,0.00005899294,0.00009202689,0.0007797112,0.001082225],"genre_scores_gemma":[0.05661099,0.0005221029,0.9392241,0.0001306088,0.00004518883,0.0002614784,0.0005014093,0.0005379108,0.0021662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008063818,"threshold_uncertainty_score":0.02697617,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Yannis Smaragdakis","is_ca":false},{"name":"Martin Bravenboer","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06018896433042852,"gpt":0.262159894383952,"spread":0.2019709300535235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003420395,0.002244084,0.001444347,0.002150975,0.003071324,0.008317025,0.002302357,0.002319418,0.03248392],"category_scores_gemma":[0.01978935,0.001751413,0.002463111,0.001418099,0.004045162,0.01788063,0.008028519,0.004558152,0.01841889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001823346,"about_ca_system_score_gemma":0.002286417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003112707,"about_ca_topic_score_gemma":0.004110958,"domain_scores_codex":[0.9943464,0.0011761,0.0003565631,0.001469529,0.001860471,0.0007909748],"domain_scores_gemma":[0.9916944,0.002154147,0.0004547746,0.00394354,0.001390195,0.0003630208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006493818,0.0001124195,0.007925835,0.0006258393,0.0001630541,0.000838287,0.002897864,0.009436856,0.01354254,0.6812559,0.04984996,0.2327021],"study_design_scores_gemma":[0.00004985178,0.00008931741,0.001431629,0.0004253267,0.000177164,0.0007043051,0.001404409,0.02389078,0.02171415,0.622183,0.3277396,0.0001905767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0353787,0.002200269,0.8400386,0.006822183,0.001588364,0.0004214171,0.001393315,0.01906681,0.09309026],"genre_scores_gemma":[0.3971876,0.00220117,0.4907984,0.007613549,0.000788802,0.0004793227,0.001818281,0.01840846,0.08070447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03248392,"threshold_uncertainty_score":0.1086696,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexander S. Green","is_ca":true},{"name":"Peter LeFanu Lumsdaine","is_ca":false},{"name":"Neil J. Ross","is_ca":true},{"name":"Peter Selinger","is_ca":true},{"name":"Benoît Valiron","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01088186685814538,"gpt":0.2256192025983448,"spread":0.2147373357401995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172282,0.0007371749,0.0007017225,0.001045147,0.001373702,0.002845734,0.002351796,0.001297433,0.05602616],"category_scores_gemma":[0.006767924,0.0006574901,0.001330713,0.0009627697,0.001896712,0.007216726,0.003055492,0.003889982,0.01772972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155328,"about_ca_system_score_gemma":0.001834472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001287654,"about_ca_topic_score_gemma":0.001774988,"domain_scores_codex":[0.9979518,0.0005014775,0.000100757,0.0004647293,0.0007604047,0.0002208416],"domain_scores_gemma":[0.997821,0.0009038633,0.000124458,0.0005028085,0.0004791527,0.0001688483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002399809,0.00007592633,0.000440346,0.0004962458,0.0000318199,0.0001371432,0.0003972285,0.002970515,0.00385396,0.6988522,0.1464414,0.1460632],"study_design_scores_gemma":[0.00006137414,0.00008935992,0.0002603849,0.000200715,0.00003068392,0.0003511662,0.00005516541,0.0220839,0.008519809,0.3238643,0.6444094,0.00007380653],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.008248459,0.00287192,0.7720183,0.006399814,0.001586866,0.0003336641,0.002353723,0.0524232,0.1537641],"genre_scores_gemma":[0.1540582,0.004859112,0.5992501,0.006632909,0.0009370803,0.001139608,0.006077807,0.02381661,0.2032286],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.05602616,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergey Zhuravlev","is_ca":true},{"name":"Sergey Blagodurov","is_ca":true},{"name":"Alexandra Fedorova","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05763234658827183,"gpt":0.3106199538624083,"spread":0.2529876072741365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925885,0.0005228564,0.0007526352,0.000721991,0.001005539,0.001199649,0.001335541,0.0005228365,0.0006993225],"category_scores_gemma":[0.005663478,0.0003290128,0.0004024338,0.001297493,0.0009974022,0.001721945,0.0009472453,0.0007538609,0.0001456024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010861,"about_ca_system_score_gemma":0.002207359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144804,"about_ca_topic_score_gemma":0.003330721,"domain_scores_codex":[0.998459,0.0005783308,0.0001048506,0.0001537816,0.0004738723,0.0002302232],"domain_scores_gemma":[0.9967265,0.001447768,0.0004247233,0.0007188417,0.000533575,0.0001484987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005129668,0.0002877236,0.007251935,0.0003203838,0.0001329134,0.0002148177,0.000399677,0.5827483,0.0598671,0.04733198,0.003105709,0.2978265],"study_design_scores_gemma":[0.00003563484,0.0001548598,0.0005182026,0.0000140274,0.00003495677,0.00006004025,0.00006427387,0.9597975,0.01749358,0.01860352,0.003206088,0.00001726618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1818963,0.001557788,0.8112563,0.0004110327,0.0001390819,0.0001319359,0.00002609546,0.001240359,0.003341005],"genre_scores_gemma":[0.766964,0.0004605253,0.2311501,0.0001039255,0.0000923897,0.00008433071,0.00004356442,0.0001132934,0.0009878285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002144804,"threshold_uncertainty_score":0.01018518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Emmi","is_ca":false},{"name":"Shaz Qadeer","is_ca":false},{"name":"Zvonimir Rakamarić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06042743518341133,"gpt":0.2581025017501475,"spread":0.1976750665667362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306421,0.0007727082,0.0005503097,0.0006151449,0.0008026804,0.001541127,0.00178761,0.0004638028,0.003754401],"category_scores_gemma":[0.005565637,0.0003896024,0.0004806906,0.0006868918,0.001445933,0.002131758,0.001557461,0.001514781,0.0006861443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001907507,"about_ca_system_score_gemma":0.001966754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059698,"about_ca_topic_score_gemma":0.002202603,"domain_scores_codex":[0.9984723,0.0002969198,0.0001081412,0.000296661,0.0005849003,0.0002410465],"domain_scores_gemma":[0.9956062,0.00199265,0.0003551787,0.001300491,0.0004935209,0.0002519252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002848659,0.00006506851,0.0008200026,0.0002220117,0.00002912012,0.0001600387,0.0002205307,0.1583189,0.01406124,0.7669447,0.003854461,0.05501906],"study_design_scores_gemma":[0.00006218471,0.0001137395,0.0001647397,0.00004256796,0.0000411733,0.0001582671,0.00003642715,0.463875,0.01280643,0.4835779,0.03908931,0.00003225399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02626552,0.001119594,0.9543768,0.0004522243,0.0002663049,0.00009420764,0.0003425267,0.001149416,0.01593335],"genre_scores_gemma":[0.6787295,0.001279207,0.3083643,0.0003798887,0.0002150757,0.0002145375,0.0005000322,0.0004284303,0.009888899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003754401,"threshold_uncertainty_score":0.01384002,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jan Hannemann","is_ca":true},{"name":"Gregor Kiczales","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08859055418377597,"gpt":0.319533329656488,"spread":0.230942775472712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002925688,0.0004525043,0.0004555506,0.00121988,0.00063173,0.003271912,0.001552173,0.001247438,0.0067207],"category_scores_gemma":[0.008463895,0.0008675026,0.001101114,0.001178039,0.0006253893,0.001985732,0.001226267,0.001681809,0.003644432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004646722,"about_ca_system_score_gemma":0.001269026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001459748,"about_ca_topic_score_gemma":0.001768055,"domain_scores_codex":[0.997029,0.000547583,0.0003862558,0.0003155283,0.001467972,0.0002535987],"domain_scores_gemma":[0.9970033,0.0007469413,0.0002487126,0.001137134,0.0007438844,0.0001199904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004455582,0.0005655725,0.004915105,0.00103903,0.0001421733,0.0009571532,0.001508307,0.007329574,0.07184789,0.1049085,0.02958944,0.7767518],"study_design_scores_gemma":[0.0005961392,0.0005035939,0.00555657,0.0003974244,0.000245256,0.004576426,0.000630797,0.112862,0.1131941,0.07885802,0.6823653,0.0002144103],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01741995,0.0001747114,0.9444724,0.0004459608,0.0001719379,0.0002460878,0.0003483509,0.02028547,0.01643511],"genre_scores_gemma":[0.08480997,0.0003704263,0.8972094,0.0003967428,0.00004127625,0.0004086093,0.00170845,0.005829395,0.009225809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0067207,"threshold_uncertainty_score":0.02248293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chris Allan","is_ca":false},{"name":"Pavel Avgustinov","is_ca":false},{"name":"Aske Simon Christensen","is_ca":false},{"name":"Laurie Hendren","is_ca":true},{"name":"Sascha Kuzins","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Oege de Moor","is_ca":false},{"name":"Damien Sereni","is_ca":false},{"name":"Ganesh Sittampalam","is_ca":false},{"name":"Julian Tibble","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02970843314310803,"gpt":0.2764361334019181,"spread":0.2467277002588101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005066585,0.0008651884,0.0008655726,0.001248973,0.0008634432,0.003235122,0.003563699,0.001540955,0.002826332],"category_scores_gemma":[0.01537152,0.001961839,0.00180892,0.0009387463,0.002789978,0.00867223,0.005041433,0.004999399,0.00102065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008394954,"about_ca_system_score_gemma":0.002114662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002156649,"about_ca_topic_score_gemma":0.002352012,"domain_scores_codex":[0.9950659,0.0009177621,0.0006831904,0.0006990377,0.002182211,0.0004519344],"domain_scores_gemma":[0.9921256,0.002804377,0.000611287,0.003019708,0.001044781,0.0003942056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000957248,0.0003568838,0.00646978,0.001278096,0.0002641095,0.001423546,0.003933661,0.01992514,0.04969731,0.5557758,0.01767624,0.3422423],"study_design_scores_gemma":[0.0002937192,0.0004118771,0.001207293,0.0002480969,0.0003428305,0.001511239,0.0002773092,0.1663933,0.07901585,0.3550007,0.3949922,0.000305596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007757283,0.0001310362,0.9741582,0.000328117,0.0002161911,0.0001059989,0.00007624561,0.01406556,0.003161237],"genre_scores_gemma":[0.1514596,0.0004027708,0.8297723,0.0009260508,0.0002951457,0.0003325114,0.0004649553,0.01018782,0.006158912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005066585,"threshold_uncertainty_score":0.02679503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Pavel Avgustinov","is_ca":false},{"name":"Aske Simon Christensen","is_ca":false},{"name":"Laurie Hendren","is_ca":true},{"name":"Sascha Kuzins","is_ca":false},{"name":"Jennifer Lhoták","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Oege de Moor","is_ca":false},{"name":"Damien Sereni","is_ca":false},{"name":"Ganesh Sittampalam","is_ca":false},{"name":"Julian Tibble","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0471053546590998,"gpt":0.3028725758971136,"spread":0.2557672212380138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002602347,0.001000423,0.0005692293,0.0009710305,0.0006015905,0.001993508,0.001787254,0.0009734877,0.002721803],"category_scores_gemma":[0.009337042,0.001151823,0.001211968,0.0007652773,0.001032214,0.00324597,0.00151433,0.002538949,0.00170017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006011532,"about_ca_system_score_gemma":0.001433486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001198196,"about_ca_topic_score_gemma":0.001729905,"domain_scores_codex":[0.9965706,0.0005990387,0.0002876843,0.0004998544,0.001726188,0.0003166345],"domain_scores_gemma":[0.9958991,0.001563616,0.0003730529,0.001066674,0.0009761756,0.0001213824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000890039,0.0002709116,0.006672416,0.001568078,0.0002942227,0.0007745953,0.001246463,0.0676478,0.2323456,0.07525861,0.03654019,0.5764911],"study_design_scores_gemma":[0.0003164388,0.00041332,0.003310272,0.0002903349,0.0004564905,0.001640822,0.0002874254,0.4567804,0.1702399,0.07419264,0.2919019,0.0001699895],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03863018,0.001413278,0.8998478,0.0006815958,0.000463614,0.0002391883,0.0002308679,0.0390906,0.0194029],"genre_scores_gemma":[0.2308881,0.001471195,0.743892,0.0006501648,0.0002594925,0.0002317907,0.001280644,0.01378099,0.007545702],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002721803,"threshold_uncertainty_score":0.01376271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vijay Sundaresan","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Chrislain Razafimahefa","is_ca":true},{"name":"Raja Vallée-Rai","is_ca":true},{"name":"Patrick Lam","is_ca":true},{"name":"Étienne Gagnon","is_ca":true},{"name":"Charles Godin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06052537541571937,"gpt":0.3429938513744404,"spread":0.282468475958721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790621,0.000928257,0.0006636651,0.001500887,0.0009848938,0.001576668,0.002084684,0.001093197,0.002520111],"category_scores_gemma":[0.01326952,0.0007424236,0.0009988648,0.001397691,0.001514272,0.003229895,0.002105222,0.002143623,0.0006446394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001309728,"about_ca_system_score_gemma":0.002172561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005141413,"about_ca_topic_score_gemma":0.005846176,"domain_scores_codex":[0.9954745,0.0009287017,0.0001872991,0.000655301,0.002357621,0.0003965424],"domain_scores_gemma":[0.9906132,0.005286697,0.001080982,0.001968482,0.0009014797,0.0001490619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006815158,0.0002335982,0.01300306,0.0006178687,0.0001502568,0.0004202435,0.001609811,0.08754077,0.09991608,0.06456914,0.009807011,0.7214506],"study_design_scores_gemma":[0.00009883696,0.0002155003,0.006411966,0.0001356943,0.0001038301,0.000481649,0.0004694381,0.7495981,0.1182063,0.09599092,0.02813572,0.0001520768],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08833875,0.0004844718,0.888534,0.0003257821,0.0000766518,0.00007878853,0.000154049,0.01941008,0.00259749],"genre_scores_gemma":[0.4103234,0.0002319269,0.5822021,0.0002706421,0.0000502573,0.00008700568,0.0004168823,0.003991568,0.00242622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005141413,"threshold_uncertainty_score":0.01022297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohammad Dashti","is_ca":true},{"name":"Alexandra Fedorova","is_ca":true},{"name":"Justin Funston","is_ca":true},{"name":"Fabien Gaud","is_ca":true},{"name":"Renaud Lachaize","is_ca":false},{"name":"Baptiste Lepers","is_ca":false},{"name":"Vivien Quéma","is_ca":false},{"name":"Mark A. Roth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01576817122047086,"gpt":0.2423602508148654,"spread":0.2265920795943945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001741196,0.001538302,0.001168196,0.00279052,0.003339269,0.005419543,0.004233663,0.001338723,0.01756092],"category_scores_gemma":[0.006097342,0.000531257,0.0007921763,0.002259726,0.0007049778,0.00397575,0.002864884,0.001535741,0.008692427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002914827,"about_ca_system_score_gemma":0.003202165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006654527,"about_ca_topic_score_gemma":0.005470211,"domain_scores_codex":[0.9976936,0.0002588279,0.0001850211,0.0005862576,0.0007769611,0.0004992441],"domain_scores_gemma":[0.9958472,0.0004183003,0.000259385,0.001181887,0.001875135,0.0004181608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007270587,0.0005921838,0.006564836,0.0003297615,0.0001262254,0.0003480738,0.0005407436,0.05506745,0.02960156,0.05605678,0.1192082,0.7308371],"study_design_scores_gemma":[0.000117371,0.000395744,0.003609361,0.000125307,0.0001647517,0.0005098534,0.0005649761,0.577686,0.04410289,0.05918491,0.3133341,0.0002047523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08081318,0.003521326,0.6893811,0.002938529,0.002969333,0.001936285,0.003371864,0.06555817,0.1495102],"genre_scores_gemma":[0.7034687,0.002132,0.1875103,0.001380085,0.001199782,0.001151621,0.008248107,0.003861176,0.09104832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01756092,"threshold_uncertainty_score":0.05874717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Song Liu","is_ca":false},{"name":"Karthik Pattabiraman","is_ca":true},{"name":"Thomas Moscibroda","is_ca":false},{"name":"Benjamin G. Zorn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05171605834278985,"gpt":0.2596344905854311,"spread":0.2079184322426413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196207,0.001004221,0.0005251632,0.0008737464,0.001034368,0.002043753,0.00238139,0.001356172,0.03403904],"category_scores_gemma":[0.00406481,0.0004814512,0.0006714467,0.0008742761,0.0008964037,0.003663072,0.00211715,0.001873379,0.01386666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001133799,"about_ca_system_score_gemma":0.00138764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001915927,"about_ca_topic_score_gemma":0.00348122,"domain_scores_codex":[0.9986717,0.0001307205,0.00006038112,0.0002913905,0.0006253881,0.0002205631],"domain_scores_gemma":[0.9981903,0.0004902601,0.0001228116,0.0006774526,0.0004373095,0.00008181631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005928724,0.0001775623,0.001783758,0.0008869726,0.00007056812,0.0005916845,0.0004261453,0.02525667,0.05093715,0.07409997,0.1436649,0.7015117],"study_design_scores_gemma":[0.0001306328,0.000379212,0.00173471,0.0002003409,0.0001188988,0.002024315,0.000174682,0.1038663,0.1206989,0.0583955,0.7121054,0.0001711383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05670597,0.005676885,0.6355458,0.004594336,0.002047336,0.0003546163,0.001522423,0.05689858,0.236654],"genre_scores_gemma":[0.453957,0.003286542,0.2652987,0.004369297,0.0004888648,0.0004042849,0.002859943,0.009535193,0.2598003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03403904,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; 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","authors":[{"name":"Ondřej Lhoták","is_ca":true},{"name":"Kwok-Chiang Andrew Chung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02764097134449946,"gpt":0.2537133634451165,"spread":0.2260723921006171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003268077,0.001564649,0.001390253,0.002283898,0.001178739,0.003429729,0.003512218,0.001198064,0.004286349],"category_scores_gemma":[0.01581055,0.001370778,0.002257829,0.001695876,0.002468215,0.006791758,0.004567748,0.003627684,0.001309369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001311868,"about_ca_system_score_gemma":0.001985533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002177903,"about_ca_topic_score_gemma":0.002123199,"domain_scores_codex":[0.9940385,0.001146818,0.0003647561,0.0007859827,0.002991027,0.0006729275],"domain_scores_gemma":[0.9890771,0.004285363,0.0006110376,0.004379127,0.001499807,0.0001476263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001053364,0.0002119189,0.0039187,0.0003965093,0.000195361,0.00045469,0.0008065783,0.2346834,0.02952028,0.4469466,0.006724888,0.2750877],"study_design_scores_gemma":[0.00006710375,0.0001441769,0.00036985,0.00006133357,0.0001376055,0.0001344125,0.000086384,0.6126601,0.0444533,0.3321039,0.009719243,0.00006266077],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01798422,0.00008439709,0.9734561,0.0002051314,0.00005076327,0.0001120814,0.0001149173,0.004809021,0.003183349],"genre_scores_gemma":[0.4404007,0.0002392881,0.5483782,0.0005828112,0.0001801804,0.0004092069,0.0004558059,0.003019627,0.006334098],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004286349,"threshold_uncertainty_score":0.01728344,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andy A. Hwang","is_ca":true},{"name":"Ioan Stefanovici","is_ca":true},{"name":"Bianca Schroeder","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01032953240259595,"gpt":0.2262867329616512,"spread":0.2159572005590553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261378,0.0003972665,0.0004598228,0.0006157406,0.0007612387,0.001132915,0.0003278883,0.000981321,0.005845234],"category_scores_gemma":[0.002985336,0.0002292251,0.0004000194,0.001251641,0.0004280585,0.0009450872,0.0003812316,0.0009006921,0.001369427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005834097,"about_ca_system_score_gemma":0.0003402556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004305909,"about_ca_topic_score_gemma":0.007501185,"domain_scores_codex":[0.999523,0.0000519895,0.00002508317,0.00009938521,0.0002288053,0.0000717206],"domain_scores_gemma":[0.9986145,0.0002913839,0.0002486017,0.0004222608,0.0003264337,0.00009682096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.001680804,0.0003332664,0.6103963,0.0008707494,0.001163724,0.002244661,0.001665656,0.02387668,0.05859162,0.02584631,0.05187755,0.2214528],"study_design_scores_gemma":[0.0001115802,0.001104919,0.725073,0.0002869056,0.0003849417,0.004073889,0.001655411,0.01385008,0.04157608,0.01495791,0.1967757,0.0001495531],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9200539,0.004024373,0.0134952,0.002632599,0.0008629273,0.00009406899,0.009079185,0.001715322,0.04804249],"genre_scores_gemma":[0.9862974,0.0007917276,0.002247465,0.0007086375,0.00007818968,0.00002006861,0.002682618,0.0001584511,0.007015559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005845234,"threshold_uncertainty_score":0.01955432,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christopher Barton","is_ca":true},{"name":"Călin Caşcaval","is_ca":false},{"name":"George Almási","is_ca":false},{"name":"Yili Zheng","is_ca":false},{"name":"Montse Farreras","is_ca":false},{"name":"Siddhartha Chatterje","is_ca":false},{"name":"José Nelson Amaral","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01619749730491173,"gpt":0.2706697248421612,"spread":0.2544722275372495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479497,0.0006282188,0.0004672621,0.0004258422,0.0009226754,0.001776343,0.001871495,0.0005167454,0.005719878],"category_scores_gemma":[0.004350062,0.0004723631,0.0006287399,0.0009141955,0.00116285,0.002168822,0.002288304,0.001418343,0.001631588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008702982,"about_ca_system_score_gemma":0.00177152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001015334,"about_ca_topic_score_gemma":0.001699208,"domain_scores_codex":[0.9984585,0.0005226344,0.0001049323,0.0001730705,0.0006105744,0.0001302553],"domain_scores_gemma":[0.9980264,0.0006930659,0.0001391836,0.0008115207,0.0002323548,0.0000973803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000170872,0.00008767981,0.001700086,0.0005493206,0.0001238499,0.0004409546,0.0007131895,0.08467967,0.01278391,0.6301865,0.03505118,0.2335128],"study_design_scores_gemma":[0.0001626057,0.0001280913,0.0007181365,0.0001189601,0.00006211555,0.0003506387,0.0001462135,0.3523862,0.01476658,0.3967181,0.2343958,0.00004650847],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008209796,0.0007316997,0.9713585,0.0005981201,0.0001730463,0.0001456986,0.00009951921,0.006491926,0.01219184],"genre_scores_gemma":[0.1504133,0.0007057722,0.8345191,0.0002994496,0.0002385158,0.0007363779,0.000471276,0.001590856,0.01102529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005719878,"threshold_uncertainty_score":0.01913488,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Micah J. Best","is_ca":true},{"name":"Shane Mottishaw","is_ca":true},{"name":"Craig Mustard","is_ca":true},{"name":"Mark A. Roth","is_ca":true},{"name":"Alexandra Fedorova","is_ca":true},{"name":"Andrew Brownsword","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03181491806750968,"gpt":0.237042772319435,"spread":0.2052278542519253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648848,0.0008696471,0.0007921004,0.0009607194,0.0009830887,0.001938529,0.001321266,0.0007502403,0.008861914],"category_scores_gemma":[0.00579852,0.0004886066,0.000612025,0.001161827,0.001398269,0.002519015,0.002332144,0.001268645,0.002189797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019051,"about_ca_system_score_gemma":0.002154774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002137147,"about_ca_topic_score_gemma":0.002280964,"domain_scores_codex":[0.9976085,0.000706039,0.0001782883,0.0005005611,0.0007328525,0.0002737521],"domain_scores_gemma":[0.9966808,0.0009356748,0.0002773692,0.001578631,0.0003976887,0.0001298332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007556443,0.0002717347,0.003123969,0.0005561688,0.0001877973,0.0004459966,0.00121829,0.1394791,0.05016432,0.3561324,0.02832866,0.4193359],"study_design_scores_gemma":[0.0002443464,0.0003586569,0.0009459963,0.00009341244,0.0001147781,0.0003447525,0.0002152605,0.5068374,0.05854397,0.2935252,0.138668,0.0001083266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01655438,0.0003568702,0.9580816,0.0003145049,0.0003218585,0.0002521167,0.0002344408,0.007858818,0.01602538],"genre_scores_gemma":[0.5569276,0.0007225273,0.4169185,0.0003600981,0.0003335506,0.0006054666,0.000817696,0.00208433,0.02123022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008861914,"threshold_uncertainty_score":0.0296461,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Bruno Dufour","is_ca":true},{"name":"Karel Driesen","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Clark Verbrugge","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02608503985579406,"gpt":0.2884924635516347,"spread":0.2624074236958406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004770015,0.001426147,0.0007587253,0.005941695,0.001067832,0.003741448,0.001260387,0.001006317,0.003152218],"category_scores_gemma":[0.03774475,0.0005297925,0.0008780726,0.006584424,0.001405034,0.005042071,0.003043268,0.001814769,0.001165888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002333986,"about_ca_system_score_gemma":0.001786462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003746773,"about_ca_topic_score_gemma":0.00324642,"domain_scores_codex":[0.9907206,0.002022762,0.00135479,0.0009470101,0.004610781,0.0003440806],"domain_scores_gemma":[0.9880723,0.004051528,0.002400921,0.00194195,0.003145456,0.0003878133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001069625,0.0001238068,0.005775904,0.0007018346,0.00007753446,0.0001280268,0.000732841,0.05419825,0.01064251,0.5715818,0.01760665,0.3383239],"study_design_scores_gemma":[0.00003801933,0.0004833319,0.008523528,0.0003932202,0.00006562357,0.0005497205,0.0003835852,0.2125506,0.009190485,0.5482554,0.2193913,0.0001752479],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01663364,0.002596993,0.9520091,0.0008223035,0.0002858682,0.0004820736,0.001974512,0.004509241,0.02068634],"genre_scores_gemma":[0.2069426,0.001809492,0.7770247,0.0003072978,0.000237175,0.002339439,0.003972767,0.001758307,0.005608257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005941695,"threshold_uncertainty_score":0.02522653,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Magnus Madsen","is_ca":true},{"name":"Frank Tip","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06467412276819863,"gpt":0.3154442103194611,"spread":0.2507700875512625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398929,0.0008760857,0.0004400939,0.001607481,0.000480518,0.0008146158,0.001219194,0.0006342029,0.0007957318],"category_scores_gemma":[0.009158387,0.0004622851,0.0006696625,0.001205372,0.0007922163,0.0009972502,0.0005140351,0.0006685326,0.000250867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000905745,"about_ca_system_score_gemma":0.001297498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003436564,"about_ca_topic_score_gemma":0.003519965,"domain_scores_codex":[0.997544,0.0004565497,0.0001562745,0.0004045358,0.001219427,0.0002192721],"domain_scores_gemma":[0.9888688,0.006627178,0.001044927,0.00133825,0.001931004,0.0001897939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001929306,0.001083033,0.1284606,0.001533472,0.0003992496,0.003894136,0.002657528,0.1732932,0.3852859,0.01521006,0.009460085,0.2767933],"study_design_scores_gemma":[0.00006639163,0.0003649838,0.03867047,0.00006526241,0.0001679502,0.0006756239,0.0002021651,0.7409731,0.207427,0.005259587,0.006029064,0.00009845172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7680398,0.0003029371,0.1984929,0.000170275,0.00006885903,0.0002046809,0.001155006,0.02846537,0.003100158],"genre_scores_gemma":[0.9312425,0.0001163896,0.06456776,0.00009485069,0.00002237014,0.0001066289,0.001257424,0.001332453,0.001259514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003436564,"threshold_uncertainty_score":0.007398367,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Zachary Kincaid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06308417104739514,"gpt":0.3242422977401453,"spread":0.2611581266927502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008283325,0.00153908,0.001194997,0.001186148,0.001216511,0.003119309,0.003417615,0.001343018,0.001979352],"category_scores_gemma":[0.02794595,0.001857565,0.003896958,0.0008802673,0.00524891,0.00881295,0.004004912,0.002405764,0.0002982637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002503725,"about_ca_system_score_gemma":0.00381666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005567364,"about_ca_topic_score_gemma":0.004382967,"domain_scores_codex":[0.9915895,0.002217334,0.0007961051,0.001885901,0.002752066,0.0007591147],"domain_scores_gemma":[0.9737623,0.01819509,0.002228166,0.004152948,0.001320885,0.0003405511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006570815,0.0002894895,0.006223932,0.0008268927,0.0003777957,0.001279848,0.001751563,0.6019886,0.04671821,0.2255511,0.0009375241,0.113398],"study_design_scores_gemma":[0.0001464557,0.0001196471,0.0003885746,0.00006348535,0.0001272104,0.0001609859,0.00008948882,0.869208,0.03278251,0.09426362,0.00259946,0.00005059379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02056711,0.00004835238,0.9771682,0.000092756,0.00001243745,0.0001108378,0.00005659644,0.001535123,0.0004085908],"genre_scores_gemma":[0.4426396,0.0001367807,0.5551521,0.0001186642,0.00003779945,0.000353915,0.0002870833,0.0004697236,0.0008043012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008283325,"threshold_uncertainty_score":0.04380697,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andrew Cave","is_ca":true},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05305382815606168,"gpt":0.2724485179284469,"spread":0.2193946897723852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009844448,0.001017823,0.001316334,0.001523038,0.001820254,0.006088198,0.005334479,0.001877088,0.008411816],"category_scores_gemma":[0.01179223,0.001863379,0.002943216,0.002008376,0.006118476,0.01732161,0.00915558,0.00503298,0.002741501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002008172,"about_ca_system_score_gemma":0.00344746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002662496,"about_ca_topic_score_gemma":0.003238202,"domain_scores_codex":[0.9939507,0.001297618,0.0008283336,0.001101963,0.002047471,0.0007738577],"domain_scores_gemma":[0.9915529,0.003110746,0.0005442167,0.003533009,0.0009502376,0.0003089474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000462941,0.00002624169,0.0004656932,0.0001444352,0.00001976505,0.0001512986,0.0007399695,0.002071777,0.002928977,0.9654945,0.001715187,0.02619576],"study_design_scores_gemma":[0.00007597628,0.0000927035,0.0002271759,0.0001561003,0.0001430529,0.0006146949,0.0002950369,0.03639137,0.02905256,0.8047749,0.1280506,0.0001258915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002414319,0.00008847762,0.9920826,0.0002219655,0.0000524301,0.00004890002,0.00008088473,0.002034479,0.002975941],"genre_scores_gemma":[0.09346531,0.0003989543,0.8930724,0.0004722775,0.000130757,0.0002818707,0.0002351485,0.001760674,0.01018262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009844448,"threshold_uncertainty_score":0.05206305,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Barthélémy Dagenais","is_ca":true},{"name":"Laurie Hendren","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06896249739321578,"gpt":0.3043800919129288,"spread":0.235417594519713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804476,0.001014261,0.001337815,0.002967836,0.001349565,0.002573409,0.002166219,0.001051112,0.002496382],"category_scores_gemma":[0.02660601,0.001258822,0.00133586,0.002399681,0.001946639,0.003903724,0.002989615,0.001570841,0.001040316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050098,"about_ca_system_score_gemma":0.003252739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00754783,"about_ca_topic_score_gemma":0.01136534,"domain_scores_codex":[0.995616,0.001149902,0.0003200774,0.0007531111,0.00170642,0.0004544727],"domain_scores_gemma":[0.9756378,0.01405996,0.00180728,0.005664486,0.002509024,0.0003214724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008047699,0.0003662948,0.02612746,0.000868899,0.0001926196,0.0009156134,0.003616145,0.1201655,0.09434258,0.05606057,0.01016791,0.6863717],"study_design_scores_gemma":[0.00005198115,0.0001354716,0.004582157,0.0001245727,0.0001247252,0.0004652895,0.000390344,0.8468056,0.08143999,0.05121037,0.01454975,0.000119815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0618417,0.0001238576,0.8965636,0.0001455569,0.00002185391,0.00009197718,0.0003898666,0.03946181,0.001359683],"genre_scores_gemma":[0.412351,0.0001731615,0.5799899,0.0001110746,0.00004453399,0.000153146,0.00152266,0.004097846,0.001556664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00754783,"threshold_uncertainty_score":0.0201202,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Louis-Julien Guillemette","is_ca":true},{"name":"Stefan Monnier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06064749100290676,"gpt":0.2688792115612433,"spread":0.2082317205583366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001517422,0.0002670173,0.0003904456,0.0005358888,0.0006953551,0.001493393,0.001033603,0.0005723815,0.00364214],"category_scores_gemma":[0.003642773,0.0005459519,0.0009420858,0.0004327251,0.001184074,0.002212794,0.001355197,0.001408121,0.001902568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006636907,"about_ca_system_score_gemma":0.001736089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008904252,"about_ca_topic_score_gemma":0.001190364,"domain_scores_codex":[0.9989027,0.0002135411,0.0001042569,0.0001431045,0.000512908,0.0001234301],"domain_scores_gemma":[0.9986319,0.000424777,0.00008174259,0.0005139504,0.0002710883,0.00007654979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003997264,0.0002040931,0.001730156,0.0007310444,0.00007722974,0.0009466632,0.001721556,0.03403342,0.03934517,0.5373222,0.03107664,0.3524122],"study_design_scores_gemma":[0.0003159756,0.000287503,0.0008163782,0.0002520364,0.00008872287,0.001101375,0.0002044667,0.1405663,0.1029603,0.515295,0.2379233,0.0001886739],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.01825529,0.0003375781,0.9384209,0.0007446819,0.0004332531,0.0001260605,0.0004079775,0.02911578,0.01215852],"genre_scores_gemma":[0.2065486,0.0004034938,0.7739446,0.000715247,0.0001850369,0.0001910142,0.0005570854,0.00509698,0.01235793],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.00364214,"threshold_uncertainty_score":0.0121842,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Magnus Madsen","is_ca":true},{"name":"Ming‐Ho Yee","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04392462176471745,"gpt":0.2999157988836089,"spread":0.2559911771188915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019076,0.0009372035,0.000764899,0.001333119,0.0008015025,0.004175114,0.002918241,0.001020018,0.00743772],"category_scores_gemma":[0.00572398,0.001158452,0.001631467,0.001203861,0.002866558,0.005628591,0.002935146,0.004890267,0.002249435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001749552,"about_ca_system_score_gemma":0.002568725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002704967,"about_ca_topic_score_gemma":0.003887604,"domain_scores_codex":[0.9980993,0.0004611494,0.0002685295,0.0003155063,0.0006963194,0.0001592919],"domain_scores_gemma":[0.9969763,0.001675758,0.0002192951,0.0004465726,0.0005320586,0.0001500631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001644943,0.00009024976,0.000569924,0.0006373108,0.00004150034,0.000334805,0.001336352,0.02507994,0.007938704,0.813384,0.03929614,0.1111265],"study_design_scores_gemma":[0.0001217766,0.00009975571,0.0002728086,0.0003035166,0.0000448356,0.000548781,0.0002984601,0.1130491,0.0179204,0.548594,0.3186218,0.0001247879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001190864,0.0001294066,0.9902478,0.000462368,0.00007439869,0.00005431204,0.0008462185,0.004562395,0.002432188],"genre_scores_gemma":[0.04874576,0.0005826445,0.9385434,0.001403057,0.0001961749,0.0004841341,0.002285196,0.002601495,0.005158172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00743772,"threshold_uncertainty_score":0.0248816,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dirk Beyer","is_ca":true},{"name":"Thomas A. Henzinger","is_ca":false},{"name":"Rupak Majumdar","is_ca":false},{"name":"Andrey Rybalchenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04224519862286649,"gpt":0.3124832385447945,"spread":0.2702380399219281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002803969,0.001271902,0.0007840893,0.003249449,0.001321539,0.002337967,0.002733072,0.001348123,0.008930077],"category_scores_gemma":[0.01497539,0.0009156644,0.003014223,0.001655109,0.002554366,0.006534007,0.003148219,0.002803004,0.002290304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001541701,"about_ca_system_score_gemma":0.002571089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0025947,"about_ca_topic_score_gemma":0.002482216,"domain_scores_codex":[0.994474,0.000694861,0.0004505642,0.001181362,0.002621394,0.0005777342],"domain_scores_gemma":[0.9894488,0.005622629,0.001043153,0.002129681,0.001614077,0.0001417568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003313589,0.0001805638,0.005438176,0.0009119064,0.0001407586,0.001008316,0.000918591,0.05496548,0.01772651,0.690479,0.01156424,0.2163351],"study_design_scores_gemma":[0.00008491321,0.0001970687,0.001773562,0.0002487481,0.0002703215,0.0007713187,0.0002394319,0.2367337,0.05995672,0.6312364,0.0683504,0.0001374455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007987701,0.0001349223,0.9819459,0.0001901536,0.00006682763,0.0002424461,0.0008771046,0.0035353,0.005019528],"genre_scores_gemma":[0.1975226,0.0005107875,0.7898023,0.0003187349,0.0001276303,0.0007550376,0.003447308,0.001363381,0.006152249],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008930077,"threshold_uncertainty_score":0.02987415,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"Nvidia","keywords":"Computer science; Kernel (algebra); Scalability; Locality; Parallel computing; Matrix multiplication; Computation; Range (aeronautics); Algorithm","authors":[{"name":"Arash Ashari","is_ca":false},{"name":"Shirish Tatikonda","is_ca":false},{"name":"Matthias Böehm","is_ca":false},{"name":"Berthold Reinwald","is_ca":false},{"name":"Keith Campbell","is_ca":true},{"name":"John Keenleyside","is_ca":true},{"name":"P. Sadayappan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03233663507408029,"gpt":0.2699771110886107,"spread":0.2376404760145304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215807,0.0008191718,0.0006679313,0.0004521458,0.000463375,0.0009408824,0.001039917,0.0005481069,0.001484628],"category_scores_gemma":[0.004707038,0.0002693538,0.0003850187,0.001127106,0.0005478196,0.002043889,0.001084782,0.0008422001,0.0007431163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008102175,"about_ca_system_score_gemma":0.001409124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002776769,"about_ca_topic_score_gemma":0.003449333,"domain_scores_codex":[0.9991034,0.0002377746,0.00005268254,0.0001162822,0.0003334364,0.0001563806],"domain_scores_gemma":[0.9983418,0.0007947963,0.0001018618,0.0003576273,0.0003282937,0.00007554132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002807308,0.0002048304,0.001937625,0.00007749915,0.00003321332,0.00007037641,0.0001136113,0.7921014,0.02056157,0.01281795,0.002602102,0.169199],"study_design_scores_gemma":[0.000004427543,0.0000192694,0.00009605317,0.000001591621,0.000002409276,0.000008693157,0.000008769422,0.9937766,0.003080202,0.002666665,0.0003326381,0.000002716967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1378842,0.0004402265,0.8526396,0.0002985323,0.00004928556,0.00007246491,0.00008540082,0.003752641,0.004777718],"genre_scores_gemma":[0.7601757,0.0002591855,0.2366837,0.00009953039,0.00004557042,0.000079649,0.0002830456,0.0003455277,0.002028031],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002776769,"threshold_uncertainty_score":0.005878568,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andreas Abel","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02353269379013488,"gpt":0.2382345287073475,"spread":0.2147018349172126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005993903,0.000493506,0.001274639,0.001016632,0.001740318,0.003213282,0.002280293,0.001084814,0.002960719],"category_scores_gemma":[0.01372699,0.001068272,0.002299178,0.0009839057,0.006196345,0.01037481,0.005836861,0.004209104,0.0008996054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003315859,"about_ca_system_score_gemma":0.002952436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003974529,"about_ca_topic_score_gemma":0.002942898,"domain_scores_codex":[0.9930835,0.001592553,0.0005722097,0.001757307,0.002207594,0.0007868836],"domain_scores_gemma":[0.9903368,0.004669603,0.0005433715,0.0027364,0.001440907,0.0002729314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006288206,0.000028636,0.001167036,0.00008690718,0.0000191395,0.0001593709,0.0009891732,0.00410999,0.003934941,0.9716414,0.0005968019,0.01720371],"study_design_scores_gemma":[0.00004402181,0.00008404502,0.0005235539,0.00008005663,0.00009049018,0.0004045422,0.0001500552,0.07876595,0.02494106,0.8655081,0.02933238,0.00007572189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03061719,0.0001976418,0.9613279,0.0003079084,0.00006387976,0.00005963324,0.00008708725,0.001982291,0.005356461],"genre_scores_gemma":[0.5591253,0.0003218185,0.4278941,0.0004666285,0.0001506164,0.0002946341,0.0002496942,0.001624772,0.009872512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005993903,"threshold_uncertainty_score":0.03169918,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"F. Fawzia Khan","is_ca":true},{"name":"Vincent Foley-Bourgon","is_ca":true},{"name":"Sujay Kathrotia","is_ca":true},{"name":"Erick Lavoie","is_ca":true},{"name":"Laurie Hendren","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05326982129687474,"gpt":0.3120641831897885,"spread":0.2587943618929137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252046,0.001183567,0.0007802508,0.001300425,0.0007400478,0.002681496,0.002269685,0.001056919,0.006513146],"category_scores_gemma":[0.01957868,0.0006484922,0.0009182632,0.002492806,0.001081118,0.002804285,0.001755895,0.002331194,0.007489607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00087692,"about_ca_system_score_gemma":0.001934847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002677122,"about_ca_topic_score_gemma":0.002148913,"domain_scores_codex":[0.9948564,0.0009915292,0.0004582155,0.0008342589,0.002538005,0.0003216001],"domain_scores_gemma":[0.9876195,0.004626377,0.0008681338,0.003567504,0.002962196,0.0003563038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001593454,0.000677397,0.008467575,0.001892465,0.0002252818,0.0008870448,0.0008425498,0.07121905,0.1370344,0.05639733,0.08706298,0.6337004],"study_design_scores_gemma":[0.0004445013,0.0003941203,0.005725195,0.0004717988,0.00009831686,0.001173345,0.0001773109,0.4582702,0.2384315,0.07534167,0.2192062,0.0002658322],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01813437,0.000557774,0.8474681,0.0005409747,0.0003962485,0.0001864731,0.001262176,0.104672,0.02678178],"genre_scores_gemma":[0.1595769,0.0006383786,0.8003181,0.0006989799,0.0001617732,0.0005995405,0.003497861,0.02618587,0.00832274],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006513146,"threshold_uncertainty_score":0.02178866,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Shumo Chu","is_ca":false},{"name":"Konstantin Weitz","is_ca":false},{"name":"Alvin Cheung","is_ca":false},{"name":"Dan Suciu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02599575075013483,"gpt":0.2683679918576917,"spread":0.2423722411075568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009966806,0.001497313,0.001394484,0.002097997,0.001874078,0.006338528,0.005300167,0.002187614,0.006644669],"category_scores_gemma":[0.04017539,0.001990314,0.005073568,0.001484471,0.00589394,0.01122616,0.007248421,0.005280179,0.001451409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00287519,"about_ca_system_score_gemma":0.005983519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01039719,"about_ca_topic_score_gemma":0.008623196,"domain_scores_codex":[0.9815261,0.004241802,0.00194874,0.002581471,0.007929556,0.001772268],"domain_scores_gemma":[0.9595309,0.02600263,0.00188642,0.006946812,0.005128226,0.0005049972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005283144,0.0005880921,0.01127865,0.001615417,0.0006290841,0.001826773,0.002359798,0.08672984,0.03441773,0.7038888,0.02181356,0.1343239],"study_design_scores_gemma":[0.0002660011,0.0002702359,0.001560836,0.0002352458,0.0004147802,0.0007677229,0.0006905482,0.4555072,0.08311863,0.4349579,0.02201672,0.0001941127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01586992,0.0001736149,0.9686193,0.0006523689,0.0001363578,0.0001757888,0.0006925925,0.0108924,0.002787543],"genre_scores_gemma":[0.4024791,0.0004757826,0.5827797,0.002104458,0.0004504315,0.0004763247,0.003611349,0.003842208,0.00378061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01039719,"threshold_uncertainty_score":0.05271012,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yann‐Gaël Guéhéneuc","is_ca":true},{"name":"Hervé Albin-Amiot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04904132694768226,"gpt":0.2737487482202274,"spread":0.2247074212725451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183721,0.0008244562,0.000984853,0.005239545,0.002162524,0.004478069,0.002099038,0.002729047,0.005045531],"category_scores_gemma":[0.04169274,0.0009316755,0.001010933,0.004100944,0.001491258,0.008386256,0.005717893,0.002922515,0.002884621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001249809,"about_ca_system_score_gemma":0.002539201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00594134,"about_ca_topic_score_gemma":0.004367982,"domain_scores_codex":[0.9933269,0.001078548,0.0003753899,0.00127455,0.003165623,0.0007789695],"domain_scores_gemma":[0.9792763,0.006916662,0.002222127,0.006979092,0.004125197,0.0004806432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002940123,0.0001553216,0.02213727,0.0003525935,0.00004503243,0.0007405312,0.001721335,0.01236472,0.01404723,0.2846404,0.01972071,0.6437809],"study_design_scores_gemma":[0.00007824621,0.00007312027,0.007445984,0.0001771597,0.00008379213,0.001246814,0.001164369,0.2872174,0.02873855,0.5423686,0.1312808,0.0001252216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08793078,0.0007339426,0.8930515,0.001102446,0.000207749,0.0001228214,0.001204279,0.003628171,0.01201835],"genre_scores_gemma":[0.4357511,0.0004433889,0.5501469,0.0003174648,0.0001544609,0.000185447,0.003236053,0.001502657,0.00826255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00594134,"threshold_uncertainty_score":0.01687896,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Richard Frost","is_ca":true},{"name":"Rahmatullah Hafiz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007901481672039504,"gpt":0.2541193857042048,"spread":0.2462179040321653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001327,0.001335243,0.001141701,0.001419201,0.001389581,0.002304218,0.002841556,0.001437488,0.01082356],"category_scores_gemma":[0.00357797,0.0009672988,0.00158333,0.001780249,0.00107755,0.004001223,0.002980292,0.002580106,0.005789606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008968825,"about_ca_system_score_gemma":0.002582364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003174736,"about_ca_topic_score_gemma":0.005062615,"domain_scores_codex":[0.9989532,0.0001421497,0.0001018455,0.0003121283,0.0003592222,0.000131361],"domain_scores_gemma":[0.9984877,0.0005155569,0.00006765609,0.000454973,0.000395811,0.00007835065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002394792,0.0002506193,0.0006134516,0.0004035156,0.0000812949,0.0003537078,0.0004961618,0.02669272,0.03027387,0.08314376,0.05172893,0.8057225],"study_design_scores_gemma":[0.0002044168,0.0001647587,0.0003851897,0.00009715562,0.000171835,0.0008335325,0.0001516979,0.6944884,0.03610992,0.1821775,0.08508892,0.0001267273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002106844,0.0001359522,0.9867801,0.0001625284,0.0001077003,0.00008543844,0.0001423487,0.007531522,0.002947566],"genre_scores_gemma":[0.02730739,0.0001528063,0.963415,0.0002509107,0.00007123015,0.0001528165,0.0006431607,0.001442545,0.00656416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01082356,"threshold_uncertainty_score":0.03620845,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yi Li","is_ca":true},{"name":"Aws Albarghouthi","is_ca":true},{"name":"Zachary Kincaid","is_ca":true},{"name":"Arie Gurfinkel","is_ca":false},{"name":"Marsha Chećhik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01283092764887383,"gpt":0.2239901630927133,"spread":0.2111592354438395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473734,0.001803604,0.001189077,0.001415159,0.0005261568,0.001695179,0.001359602,0.001252124,0.008946152],"category_scores_gemma":[0.006430387,0.0007298065,0.001959667,0.001697346,0.001459153,0.001372584,0.002001835,0.002324261,0.00226223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001536677,"about_ca_system_score_gemma":0.002308377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003241993,"about_ca_topic_score_gemma":0.004824417,"domain_scores_codex":[0.9981151,0.0006927432,0.0001203169,0.0002310231,0.0006772652,0.0001636542],"domain_scores_gemma":[0.9969875,0.002244692,0.0001920542,0.0002790028,0.0002440273,0.00005279047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001009218,0.00006558283,0.0004646434,0.0004131958,0.00007948019,0.00009574806,0.00006938921,0.8120487,0.002724846,0.08595958,0.003145615,0.09483229],"study_design_scores_gemma":[0.00003231282,0.00001990176,0.00003932175,0.00002825791,0.00001384892,0.00001837058,0.00001192864,0.9577589,0.001341283,0.03707799,0.003651622,0.000006190738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004089167,0.0003437821,0.9837753,0.0002429768,0.00005792699,0.0000654063,0.0001473248,0.002390088,0.008888002],"genre_scores_gemma":[0.1405907,0.0006603634,0.8514326,0.0002578539,0.0001054238,0.0004826427,0.0006172282,0.001180581,0.004672593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008946152,"threshold_uncertainty_score":0.02992785,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kıvanç Muşlu","is_ca":false},{"name":"Yuriy Brun","is_ca":false},{"name":"Reid Holmes","is_ca":true},{"name":"Michael D. Ernst","is_ca":false},{"name":"David Notkin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04011398993521328,"gpt":0.2883590507156111,"spread":0.2482450607803978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005918839,0.0008404732,0.0006287274,0.002038284,0.0006044199,0.001888147,0.001365219,0.0008413342,0.003600616],"category_scores_gemma":[0.0866292,0.0008190723,0.0007979947,0.001815557,0.0006293437,0.002715115,0.001205461,0.001460919,0.0004948777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366029,"about_ca_system_score_gemma":0.001821659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01232399,"about_ca_topic_score_gemma":0.0179114,"domain_scores_codex":[0.992652,0.002299661,0.0003651347,0.0008844111,0.003324591,0.0004741547],"domain_scores_gemma":[0.9202562,0.06312679,0.002910171,0.005822577,0.007327456,0.0005567783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002558933,0.0005047161,0.1916659,0.0008763861,0.0004931901,0.001373719,0.002173761,0.4034904,0.01989481,0.0349121,0.01331613,0.3287401],"study_design_scores_gemma":[0.00006568646,0.00009996226,0.01167377,0.00003258107,0.00006749287,0.00008427595,0.0002027953,0.9727692,0.003620785,0.00892878,0.002430666,0.00002414864],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5951471,0.0006156454,0.3862731,0.001421584,0.0001071388,0.0006049414,0.002174151,0.004565384,0.009090808],"genre_scores_gemma":[0.8659952,0.000153541,0.1292762,0.0001384952,0.00003951007,0.0001786796,0.002052675,0.0003452484,0.001820383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01232399,"threshold_uncertainty_score":0.03130221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Ding Yuan","is_ca":false},{"name":"Haohui Mai","is_ca":false},{"name":"Weiwei Xiong","is_ca":false},{"name":"Lin Tan","is_ca":true},{"name":"Yuanyuan Zhou","is_ca":false},{"name":"Shankar Pasupathy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01029332178757227,"gpt":0.2435370911879403,"spread":0.233243769400368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00280586,0.001780986,0.001352945,0.002523063,0.0009122647,0.003542216,0.00694082,0.002034917,0.1412704],"category_scores_gemma":[0.008861805,0.002047316,0.001705969,0.002023249,0.0007772116,0.006547058,0.003662112,0.003300335,0.09953021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222557,"about_ca_system_score_gemma":0.002841362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002776089,"about_ca_topic_score_gemma":0.004596274,"domain_scores_codex":[0.9980545,0.0002575056,0.0001789033,0.0003355077,0.0009264867,0.0002470802],"domain_scores_gemma":[0.9953607,0.001763461,0.0002542862,0.001414889,0.0009595426,0.0002471719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008937303,0.0002684901,0.002090186,0.001266757,0.00009092918,0.0003752313,0.0001906004,0.004661283,0.003672512,0.02176603,0.8099876,0.1547367],"study_design_scores_gemma":[0.000599885,0.0001863928,0.001407712,0.0002402877,0.00006332172,0.0005480282,0.0001395331,0.05772189,0.01162126,0.04510007,0.8822428,0.0001288311],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.003264249,0.0006619223,0.1807936,0.001194591,0.0005948932,0.0006451971,0.06451356,0.6969267,0.05140535],"genre_scores_gemma":[0.07757071,0.002326026,0.2583306,0.003872912,0.000505961,0.002520476,0.3786293,0.1543747,0.1218692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1412704,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andreas Abel","is_ca":false},{"name":"Brigitte Pientka","is_ca":true},{"name":"David Thibodeau","is_ca":true},{"name":"Anton Setzer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02893206053508614,"gpt":0.2500366596544939,"spread":0.2211045991194077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005391953,0.0009477386,0.001276777,0.001847779,0.002562216,0.0048813,0.003464887,0.001819023,0.01161967],"category_scores_gemma":[0.01241449,0.001435268,0.002802307,0.002162498,0.006126549,0.01572446,0.00839381,0.004207235,0.003338761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00198851,"about_ca_system_score_gemma":0.002469627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002433635,"about_ca_topic_score_gemma":0.001733926,"domain_scores_codex":[0.9930807,0.00111483,0.001002305,0.002229119,0.001813193,0.000759891],"domain_scores_gemma":[0.9894489,0.003405326,0.0007697612,0.004174466,0.001880342,0.0003211628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007976354,0.00002902663,0.001157915,0.0001428759,0.00002859109,0.0001905679,0.001025848,0.0007638968,0.0021334,0.9569611,0.004156426,0.03333078],"study_design_scores_gemma":[0.00003282881,0.00007627666,0.0004488836,0.0001909156,0.00008857492,0.0007485736,0.0003975803,0.01233554,0.01783399,0.7611064,0.2066538,0.0000866738],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01300145,0.0003493562,0.9611788,0.0006202578,0.0002929332,0.0001800399,0.0007354938,0.004125325,0.01951633],"genre_scores_gemma":[0.3707402,0.001005528,0.5693924,0.002037579,0.0005541684,0.001498172,0.002832215,0.006448392,0.04549133],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01161967,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Rashina Hoda","is_ca":false},{"name":"Philippe Kruchten","is_ca":true},{"name":"James Noble","is_ca":false},{"name":"Stuart Marshall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01682338457458814,"gpt":0.2689305406292369,"spread":0.2521071560546488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051919,0.0004870115,0.000348394,0.001834322,0.003595273,0.006468948,0.0007798556,0.001370914,0.003567913],"category_scores_gemma":[0.005269586,0.000357623,0.0002401201,0.001546466,0.0100013,0.006894889,0.00834264,0.002266391,0.0004119598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094964,"about_ca_system_score_gemma":0.001462687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002849247,"about_ca_topic_score_gemma":0.003934026,"domain_scores_codex":[0.9948881,0.003452155,0.0001242532,0.0006879283,0.0003940686,0.0004534469],"domain_scores_gemma":[0.9959979,0.002222059,0.0004789692,0.0004856969,0.0003246223,0.0004907973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001653185,0.0001157757,0.03122756,0.0007024384,0.00007397323,0.003189421,0.1823238,0.00426019,0.004615585,0.6262254,0.007534969,0.1395657],"study_design_scores_gemma":[0.00003645472,0.0001852478,0.02126945,0.0009739823,0.00008310451,0.003072182,0.1226936,0.004681448,0.002822671,0.5126238,0.3314566,0.0001015066],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5146465,0.01455256,0.0997128,0.02954832,0.0005649351,0.0001609228,0.0002378687,0.0004491292,0.3401269],"genre_scores_gemma":[0.9901663,0.0009101122,0.005555923,0.0007299667,0.00005906465,0.00005621977,0.00003585374,0.00003216463,0.00245451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006468948,"threshold_uncertainty_score":0.01520014,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Executable; Programming language; Compiler; Compile time; Just-in-time compilation; Java; Theoretical computer science; Inheritance (genetic algorithm); Parallel computing","authors":[{"name":"Roland Ducournau","is_ca":false},{"name":"Floréal Morandat","is_ca":false},{"name":"Jean Privat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04083546651247664,"gpt":0.3391471307351192,"spread":0.2983116642226425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05417006,0.0008161814,0.0006377675,0.003359101,0.000971404,0.002974548,0.002402294,0.001366307,0.002093536],"category_scores_gemma":[0.3583249,0.0009718835,0.0007442417,0.004118755,0.003479915,0.008017465,0.00325392,0.001656737,0.0005857816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001271134,"about_ca_system_score_gemma":0.0009656735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007994572,"about_ca_topic_score_gemma":0.001412755,"domain_scores_codex":[0.9426159,0.02898963,0.00560641,0.004556408,0.01698122,0.001250376],"domain_scores_gemma":[0.3231817,0.5701002,0.03461401,0.04565804,0.02482665,0.001619218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002555737,0.003443846,0.5037546,0.002972667,0.0009639083,0.0007389156,0.009166844,0.0427984,0.007792189,0.03641922,0.003384179,0.3860095],"study_design_scores_gemma":[0.0006434265,0.0123264,0.6111955,0.001684407,0.002064193,0.004881279,0.0159962,0.2272279,0.04166469,0.0413194,0.04064656,0.0003500298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9431502,0.001397056,0.04490795,0.0004649595,0.00002896187,0.0002741128,0.0003210073,0.000261673,0.009194084],"genre_scores_gemma":[0.9627585,0.0008506735,0.03389952,0.00007805239,0.00004445366,0.000238617,0.0006187308,0.0002212686,0.001290241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05417006,"threshold_uncertainty_score":0.2864821,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kai Shen","is_ca":false},{"name":"Arrvindh Shriraman","is_ca":true},{"name":"Sandhya Dwarkadas","is_ca":false},{"name":"Xiao Zhang","is_ca":false},{"name":"Zhuan Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01080499698835507,"gpt":0.2213848371067874,"spread":0.2105798401184324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280607,0.001072686,0.0005372495,0.0005559768,0.0007268137,0.002190648,0.002898699,0.0006697244,0.0359343],"category_scores_gemma":[0.003430504,0.0005998153,0.0005399861,0.0006918514,0.0006347199,0.003883733,0.002981774,0.001519514,0.01277577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00075746,"about_ca_system_score_gemma":0.001164359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002042266,"about_ca_topic_score_gemma":0.001881473,"domain_scores_codex":[0.9988455,0.0001343217,0.00008719997,0.0002340497,0.0004922705,0.0002067125],"domain_scores_gemma":[0.9976289,0.0003055609,0.0001432251,0.001229659,0.0005001337,0.0001926985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001732685,0.0003518878,0.007658638,0.0006802732,0.0001382206,0.0005493624,0.0007659123,0.03291731,0.03239875,0.09081741,0.3319378,0.5000517],"study_design_scores_gemma":[0.0001770014,0.0002834145,0.002880476,0.0001163288,0.00006845855,0.0005910753,0.0001985659,0.1934046,0.04043894,0.03067019,0.7310409,0.0001299647],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07279938,0.001320995,0.5287293,0.001518,0.001503243,0.001119885,0.00535654,0.2040322,0.1836203],"genre_scores_gemma":[0.6641684,0.001180834,0.1681514,0.00184419,0.0003969106,0.0009973543,0.01204537,0.02455099,0.1266645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0359343,"threshold_uncertainty_score":0.1202122,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Puneet Kapur","is_ca":true},{"name":"Brad Cossette","is_ca":true},{"name":"Robert J. Walker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03467563794292089,"gpt":0.28359976719964,"spread":0.2489241292567191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007159416,0.001165464,0.0008023924,0.002293733,0.001493942,0.002319698,0.003800739,0.002740552,0.005759165],"category_scores_gemma":[0.04677531,0.001144098,0.001278156,0.002131279,0.001269764,0.005833359,0.004998804,0.002850133,0.003174688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008876819,"about_ca_system_score_gemma":0.003195351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307379,"about_ca_topic_score_gemma":0.003898063,"domain_scores_codex":[0.9925374,0.002752176,0.0006373571,0.0008844085,0.00274938,0.0004391818],"domain_scores_gemma":[0.951265,0.01708663,0.004108234,0.02108046,0.005894777,0.0005648571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00042182,0.0004679915,0.01435135,0.001311374,0.0001254641,0.001366191,0.003501878,0.01840528,0.06596809,0.03035345,0.02532589,0.8384012],"study_design_scores_gemma":[0.0003707758,0.0007210265,0.01014374,0.001288085,0.0004798603,0.003448884,0.001177003,0.2244144,0.2560139,0.05623401,0.4451804,0.0005279322],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06538603,0.001571625,0.8656142,0.001055568,0.0002997353,0.0003729133,0.0003313188,0.05839985,0.00696877],"genre_scores_gemma":[0.2072413,0.0007905479,0.7782799,0.0004590044,0.0001089724,0.0002910387,0.0009727634,0.006427214,0.005429244],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007159416,"threshold_uncertainty_score":0.03786302,"prediction_status":"machine_predicted_unvalidated"},"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":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Rumi Zahir","is_ca":false},{"name":"Jonathan Ross","is_ca":true},{"name":"Dale Morris","is_ca":true},{"name":"Drew Hess","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02859106683194543,"gpt":0.265078318118973,"spread":0.2364872512870276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255342,0.0003901424,0.0002366991,0.0005047495,0.0005316034,0.001962543,0.0005502318,0.0005150113,0.001874753],"category_scores_gemma":[0.002524471,0.000561188,0.0003893935,0.000619579,0.0006752245,0.001798279,0.0005811146,0.001597741,0.0007122624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006247257,"about_ca_system_score_gemma":0.001582008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00109012,"about_ca_topic_score_gemma":0.003080983,"domain_scores_codex":[0.9994955,0.0001340342,0.0000604714,0.00005147101,0.0001697451,0.00008860376],"domain_scores_gemma":[0.999221,0.0002327862,0.00008198932,0.0001040132,0.00031267,0.00004755634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000873277,0.0001245819,0.005823399,0.0008228199,0.00006876793,0.001111587,0.001569934,0.09305505,0.1126649,0.4521664,0.009800222,0.321919],"study_design_scores_gemma":[0.0002146419,0.001668534,0.006348169,0.0005988993,0.000373569,0.001440132,0.001046302,0.1895318,0.1061805,0.1801177,0.5123007,0.0001791688],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2185249,0.007289123,0.6415781,0.006877064,0.00185539,0.0004467707,0.0002306125,0.003736605,0.1194614],"genre_scores_gemma":[0.5983551,0.002483777,0.3653164,0.001685771,0.000327392,0.0002949538,0.0001453754,0.0007215189,0.03066971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001962543,"threshold_uncertainty_score":0.006639004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shriram Rajagopalan","is_ca":true},{"name":"Brendan Cully","is_ca":true},{"name":"Ryan O'Connor","is_ca":true},{"name":"Andrew Warfield","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0209380154092813,"gpt":0.2428657893768349,"spread":0.2219277739675536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009831242,0.0008780341,0.0004797781,0.0007642574,0.0007050739,0.002551564,0.00205456,0.0007371279,0.05052561],"category_scores_gemma":[0.002077625,0.000566813,0.0004727451,0.0006061011,0.0007087259,0.002474411,0.00224943,0.001712336,0.0225579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009932341,"about_ca_system_score_gemma":0.001711115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001909453,"about_ca_topic_score_gemma":0.003026817,"domain_scores_codex":[0.9982684,0.0001998236,0.00008566387,0.0002555349,0.0009038987,0.0002866721],"domain_scores_gemma":[0.9986479,0.0001876195,0.00008459682,0.0002780839,0.0005812272,0.0002205972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002000743,0.0004929464,0.00411709,0.001333242,0.0001135979,0.0006799028,0.001082348,0.01374013,0.04618823,0.1383218,0.3513993,0.4405307],"study_design_scores_gemma":[0.0001010348,0.000303192,0.0005140255,0.00006414136,0.00002792895,0.0004354017,0.00009523162,0.0220308,0.02087584,0.004854335,0.9506431,0.00005502203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02883905,0.002302397,0.4340079,0.00186366,0.001887589,0.00113656,0.003291483,0.1491356,0.3775358],"genre_scores_gemma":[0.3099325,0.002380506,0.2802393,0.002972262,0.0005998733,0.001080985,0.01677273,0.02381996,0.3622018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05052561,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Tam","is_ca":true},{"name":"Reza Azimi","is_ca":true},{"name":"Livio Soares","is_ca":true},{"name":"Michael Stumm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02070682735645182,"gpt":0.2700367176350224,"spread":0.2493298902785706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760746,0.001433887,0.0009886614,0.003411018,0.0005570535,0.001269794,0.003097966,0.000972511,0.01725083],"category_scores_gemma":[0.01205636,0.0006058586,0.0006054305,0.002665195,0.0003337837,0.001470382,0.00108055,0.0008715147,0.007987258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001230185,"about_ca_system_score_gemma":0.001525347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006365058,"about_ca_topic_score_gemma":0.006587715,"domain_scores_codex":[0.9973575,0.0003583127,0.0001428108,0.0005271594,0.001394512,0.0002196897],"domain_scores_gemma":[0.9900188,0.002289553,0.001039176,0.003244937,0.003241993,0.0001655167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001375451,0.0003382438,0.009378827,0.0008949736,0.000184868,0.0004338475,0.0002472757,0.0939689,0.04503058,0.01398979,0.122481,0.7116762],"study_design_scores_gemma":[0.0002265756,0.0004698712,0.009539134,0.0001073443,0.00007414805,0.0009841468,0.00007752706,0.7617584,0.1042279,0.007527249,0.1146795,0.0003283737],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09444012,0.002230455,0.6039267,0.0005535175,0.0004982727,0.001144888,0.01939058,0.2283659,0.0494496],"genre_scores_gemma":[0.4800412,0.0006179677,0.4773806,0.0005056355,0.0002100562,0.001077812,0.01332548,0.009373288,0.01746787],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01725083,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Patrick Colp","is_ca":true},{"name":"Jiawen Zhang","is_ca":true},{"name":"James P. Gleeson","is_ca":true},{"name":"Sahil Suneja","is_ca":true},{"name":"Eyal de Lara","is_ca":true},{"name":"Himanshu Raj","is_ca":false},{"name":"Stefan Saroiu","is_ca":false},{"name":"Alec Wolman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1716073472514013,"gpt":0.3224399001503169,"spread":0.1508325528989156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231187,0.0005383911,0.0006454656,0.0008996816,0.0009648417,0.002198541,0.0007424329,0.001454395,0.006236771],"category_scores_gemma":[0.005770042,0.0003977208,0.00048968,0.0006130239,0.0008697403,0.002155335,0.003003917,0.001199467,0.003119693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005814122,"about_ca_system_score_gemma":0.0006895902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001045393,"about_ca_topic_score_gemma":0.0009081924,"domain_scores_codex":[0.9983155,0.0003034073,0.0001665576,0.0001926644,0.0007549814,0.0002668427],"domain_scores_gemma":[0.9954315,0.000730234,0.0004893147,0.002774445,0.0004282148,0.0001461771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00157063,0.0002459078,0.01741379,0.001159481,0.0002532143,0.00314353,0.003034666,0.007615865,0.1854603,0.08405597,0.06737626,0.6286705],"study_design_scores_gemma":[0.0002664323,0.0009357943,0.01448781,0.0007242236,0.0003730558,0.00622608,0.001007649,0.06216708,0.4831308,0.03292377,0.3975493,0.0002080137],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.545737,0.01127668,0.2484522,0.006620095,0.001026576,0.00103033,0.00309391,0.01810951,0.1646537],"genre_scores_gemma":[0.9557326,0.001375904,0.01978378,0.001205232,0.0001522808,0.0001670555,0.0005859679,0.0003387086,0.02065852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006236771,"threshold_uncertainty_score":0.02086407,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03549497197042957,"gpt":0.2581122223749779,"spread":0.2226172504045484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004947713,0.0007433897,0.000838714,0.001519974,0.002056418,0.0049122,0.002726861,0.001744099,0.004618167],"category_scores_gemma":[0.004828872,0.001141641,0.003097941,0.002102705,0.007203108,0.01213415,0.004165578,0.007002363,0.002053092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002512536,"about_ca_system_score_gemma":0.003593514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002175858,"about_ca_topic_score_gemma":0.001573853,"domain_scores_codex":[0.9973326,0.0006172837,0.0003165109,0.0004163757,0.001029529,0.0002877997],"domain_scores_gemma":[0.9965127,0.001184568,0.0003251331,0.001014556,0.0007589122,0.0002042049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005479331,0.000006483446,0.0000517205,0.00002931372,0.000003684175,0.00002437329,0.0001612033,0.0009108934,0.000599142,0.9934453,0.0004660217,0.004296476],"study_design_scores_gemma":[0.00001778957,0.0000265817,0.00008114273,0.0000440852,0.00001945886,0.000126921,0.00006336318,0.01037645,0.002368949,0.9621918,0.02465463,0.0000288409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002748543,0.0002204116,0.9908483,0.0006119912,0.0001187524,0.00003480461,0.00009674236,0.0006065301,0.004713951],"genre_scores_gemma":[0.1627453,0.001002676,0.8274391,0.0007881661,0.0005053894,0.0003211664,0.0003430162,0.0005391721,0.006315924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004947713,"threshold_uncertainty_score":0.02616626,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Ronald Garcia","is_ca":true},{"name":"Alison M. Clark","is_ca":true},{"name":"Éric Tanter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04552239643461935,"gpt":0.2721415908594423,"spread":0.226619194424823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007998979,0.001066968,0.0006951626,0.001956026,0.001704485,0.005634009,0.002655945,0.001875946,0.00310593],"category_scores_gemma":[0.01853012,0.001439994,0.002543018,0.001026832,0.009929596,0.01271667,0.007425364,0.005827881,0.001005416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002690181,"about_ca_system_score_gemma":0.002843056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00226194,"about_ca_topic_score_gemma":0.001701107,"domain_scores_codex":[0.9916673,0.0025127,0.0007674942,0.001780181,0.00270547,0.0005668091],"domain_scores_gemma":[0.9824507,0.004909365,0.001426404,0.00770268,0.002949542,0.0005612633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002961403,0.0000113497,0.0004992586,0.0001006349,0.00002190033,0.00009541583,0.001104724,0.003169017,0.001813036,0.9778538,0.0006817218,0.01461949],"study_design_scores_gemma":[0.00004264321,0.00009869898,0.0002406515,0.0001785033,0.00008990639,0.0003955674,0.0003243762,0.0169703,0.006086253,0.9150967,0.06039937,0.00007707693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01145269,0.0005742201,0.9752883,0.001108245,0.0002692341,0.00006061375,0.00007088616,0.0007872665,0.01038851],"genre_scores_gemma":[0.3843657,0.00135863,0.5940652,0.001642406,0.0005511891,0.0002919284,0.0002215336,0.0008852047,0.01661805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007998979,"threshold_uncertainty_score":0.04230314,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Max Schäfer","is_ca":false},{"name":"Manu Sridharan","is_ca":false},{"name":"Julian Dolby","is_ca":false},{"name":"Frank Tip","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01462332702158383,"gpt":0.2669698366788959,"spread":0.2523465096573121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003234593,0.001298313,0.001237234,0.004511478,0.00287301,0.003350849,0.002572486,0.001392226,0.007596744],"category_scores_gemma":[0.0161017,0.001268556,0.002555093,0.002289867,0.00421722,0.006341499,0.005845853,0.003758244,0.002406175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00215758,"about_ca_system_score_gemma":0.003974565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003787965,"about_ca_topic_score_gemma":0.003248759,"domain_scores_codex":[0.9919474,0.001142931,0.0004072747,0.001600279,0.003644374,0.001257826],"domain_scores_gemma":[0.9877309,0.005232029,0.0009962787,0.00322761,0.002581451,0.0002317713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004864188,0.0002023374,0.009541548,0.000569882,0.0001597491,0.001148441,0.001539332,0.03587564,0.02794195,0.6719609,0.01088472,0.2396891],"study_design_scores_gemma":[0.00005067962,0.00009492882,0.001599381,0.0002356229,0.0002376243,0.0008895024,0.0002588385,0.1474435,0.05680592,0.7304494,0.0617802,0.0001544394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01236783,0.000267527,0.969883,0.0004973551,0.000114755,0.000142611,0.000422349,0.004239446,0.0120652],"genre_scores_gemma":[0.4927328,0.0007673462,0.4834991,0.0009777179,0.0003519127,0.0006698308,0.001329212,0.003360498,0.01631167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007596744,"threshold_uncertainty_score":0.02541357,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Zachary Kincaid","is_ca":true},{"name":"Andreas Podelski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04660543932888916,"gpt":0.2677414092628199,"spread":0.2211359699339307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003114922,0.001094476,0.0006453951,0.00220333,0.001456273,0.00205618,0.00248318,0.001147683,0.005433366],"category_scores_gemma":[0.01133246,0.0007104262,0.001969305,0.00148846,0.00358395,0.006162995,0.002352095,0.002292692,0.001152655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016624,"about_ca_system_score_gemma":0.002313363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005078883,"about_ca_topic_score_gemma":0.003946919,"domain_scores_codex":[0.9960099,0.001023694,0.0003265124,0.0008444037,0.001327296,0.0004681219],"domain_scores_gemma":[0.9866644,0.008186458,0.000808485,0.001782388,0.002291879,0.0002663165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002378113,0.0001506957,0.001702844,0.0004194852,0.0000481574,0.0004593311,0.0007651866,0.04477427,0.009631984,0.8419154,0.004639704,0.09525515],"study_design_scores_gemma":[0.00004630519,0.0000718032,0.0002943339,0.00009766865,0.00005737604,0.000155366,0.0001330342,0.1028279,0.01818782,0.8474837,0.03059249,0.00005221513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006228467,0.00005197727,0.9867931,0.0002035528,0.00003599959,0.0001942561,0.0006107969,0.001640998,0.004240749],"genre_scores_gemma":[0.2744614,0.0003867061,0.7115163,0.0006455359,0.000154827,0.001264443,0.003445177,0.000977248,0.007148417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005433366,"threshold_uncertainty_score":0.0181765,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jérǒme Simèon","is_ca":true},{"name":"Philip Wadler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01570635196451936,"gpt":0.2509543156734476,"spread":0.2352479637089283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004234009,0.0008058589,0.000784306,0.002705742,0.002179882,0.009970904,0.002317549,0.003281431,0.01211121],"category_scores_gemma":[0.01210925,0.0005942904,0.000924807,0.004519456,0.007434819,0.01478073,0.005643188,0.004764074,0.006920339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152225,"about_ca_system_score_gemma":0.00289554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002660753,"about_ca_topic_score_gemma":0.001462258,"domain_scores_codex":[0.9942154,0.00187917,0.0005741735,0.0008765091,0.002177267,0.0002773952],"domain_scores_gemma":[0.9937789,0.002554307,0.000468736,0.002063391,0.0008595629,0.0002750705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001678205,0.00001178418,0.0002132307,0.0002308541,0.00001660762,0.0001168777,0.001022704,0.000453103,0.00058255,0.9253715,0.02003433,0.05192962],"study_design_scores_gemma":[0.000006259376,0.00001618239,0.0001456734,0.0002799038,0.000009625726,0.0003377809,0.0002930999,0.0005444314,0.0004235235,0.2501399,0.7477864,0.00001727363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005989165,0.03232485,0.5945636,0.0399445,0.005202331,0.000477012,0.003783748,0.003588107,0.3141267],"genre_scores_gemma":[0.1595417,0.04653625,0.567459,0.02940169,0.006801472,0.001280789,0.007657138,0.002553523,0.1787684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01211121,"threshold_uncertainty_score":0.04051608,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Aws Albarghouthi","is_ca":true},{"name":"Rahul Kumar","is_ca":false},{"name":"Aditya V. Nori","is_ca":false},{"name":"Sriram K. Rajamani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08809835399604228,"gpt":0.3637649504610175,"spread":0.2756665964649753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003206057,0.002379843,0.00152237,0.002402756,0.001278169,0.002996664,0.003110713,0.0009479586,0.003892688],"category_scores_gemma":[0.01197543,0.001112347,0.003448121,0.001579002,0.002459951,0.004743254,0.006123002,0.002876165,0.00170807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002009409,"about_ca_system_score_gemma":0.004686271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00823197,"about_ca_topic_score_gemma":0.01045686,"domain_scores_codex":[0.9934608,0.001314609,0.0003358697,0.001054544,0.002816964,0.001017257],"domain_scores_gemma":[0.9907244,0.003846853,0.0005206686,0.003213185,0.001403382,0.0002914351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001126232,0.000540707,0.01068935,0.001133961,0.0004293468,0.001037615,0.001810992,0.2317141,0.07513385,0.09787559,0.01564998,0.5628583],"study_design_scores_gemma":[0.0001368814,0.0002228459,0.001913687,0.0001192366,0.0002511836,0.0002587848,0.0002876385,0.7123999,0.06341659,0.2017606,0.01911439,0.000118173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03134104,0.0004298211,0.9475266,0.0005523987,0.0001205877,0.0003112394,0.0003410778,0.01485683,0.004520402],"genre_scores_gemma":[0.3081073,0.0003557739,0.6801394,0.0005752171,0.000172929,0.000436105,0.001395687,0.003861637,0.004956041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00823197,"threshold_uncertainty_score":0.01695544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Asma Mehiaoui","is_ca":false},{"name":"Ernest Woźniak","is_ca":false},{"name":"Sara Tucci-Piergiovanni","is_ca":false},{"name":"Chokri Mraidha","is_ca":false},{"name":"Marco Di Natale","is_ca":false},{"name":"Haibo Zeng","is_ca":true},{"name":"Jean‐Philippe Babau","is_ca":false},{"name":"Laurent Lemarchand","is_ca":false},{"name":"Sébastien Gérard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01881043873557907,"gpt":0.2596678242833735,"spread":0.2408573855477945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454083,0.001590638,0.0008704583,0.00100474,0.0006907291,0.0007195028,0.001345596,0.0009945896,0.002534022],"category_scores_gemma":[0.002486398,0.0009346878,0.001287584,0.001073485,0.0009217479,0.0008629235,0.001119717,0.002112469,0.0006376766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062409,"about_ca_system_score_gemma":0.001818445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003077497,"about_ca_topic_score_gemma":0.003875873,"domain_scores_codex":[0.9991394,0.000304816,0.00003047324,0.0001122506,0.0003370774,0.00007591458],"domain_scores_gemma":[0.9993653,0.0003869654,0.00006582824,0.00004936781,0.000108541,0.00002402574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000810108,0.0001054085,0.0002393482,0.0001824599,0.00005923865,0.00008761001,0.0001503157,0.8169674,0.01356812,0.03666545,0.002292892,0.1296007],"study_design_scores_gemma":[0.0000319374,0.0001180469,0.0001219925,0.0000204854,0.00002198276,0.00005898645,0.00001854879,0.9805398,0.004058104,0.01153667,0.003457967,0.00001548768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008442085,0.0000454047,0.9984071,0.0000409041,0.00001360462,0.00003073162,0.000006047676,0.00009025637,0.0005217979],"genre_scores_gemma":[0.06192874,0.000149143,0.9353109,0.00008552808,0.00003463249,0.0002810564,0.00004061148,0.0001143456,0.002055013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003077497,"threshold_uncertainty_score":0.008477151,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Victor Nicolet","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0332562492190776,"gpt":0.2947483492212483,"spread":0.2614921000021707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000857443,0.0006413547,0.0005953994,0.0006728781,0.0007319688,0.0009042123,0.0008546587,0.0004413364,0.002187173],"category_scores_gemma":[0.003625104,0.0004370004,0.0007314243,0.0007852393,0.001036795,0.0008328235,0.0007491326,0.0007187099,0.0006174602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008016148,"about_ca_system_score_gemma":0.001439254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001623006,"about_ca_topic_score_gemma":0.002435055,"domain_scores_codex":[0.9989507,0.0001606099,0.00005941252,0.000211406,0.0004975408,0.000120296],"domain_scores_gemma":[0.998444,0.0006507856,0.000174311,0.0003081271,0.0003780087,0.00004473646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005122401,0.0002303555,0.002600195,0.0006933629,0.00008042249,0.0004875264,0.0007529751,0.3693546,0.1329996,0.1501436,0.006454833,0.3356901],"study_design_scores_gemma":[0.00008112924,0.0001848577,0.000257794,0.00003777573,0.00004461574,0.0001275504,0.00007890261,0.8131881,0.1109263,0.06158248,0.01347137,0.00001924023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04468591,0.0001700543,0.9451987,0.0001215868,0.00004074517,0.00008681639,0.00009696621,0.003206707,0.006392554],"genre_scores_gemma":[0.3026246,0.0001339886,0.6921787,0.00008603431,0.00003404708,0.0001886029,0.0003021934,0.0007648221,0.003687026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002187173,"threshold_uncertainty_score":0.007316768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}